Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Advances in computational mathematics
| Advances in computational mathematics |
| Pubbl/distr/stampa | [Amsterdam, the Netherlands], : Baltzer Science Publishers |
| Soggetto topico |
Numerical analysis
Numerical calculations |
| ISSN | 1572-9044 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996209726703316 |
| [Amsterdam, the Netherlands], : Baltzer Science Publishers | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in computational mathematics
| Advances in computational mathematics |
| Pubbl/distr/stampa | [Amsterdam, the Netherlands], : Baltzer Science Publishers |
| Soggetto topico |
Numerical analysis
Numerical calculations Anàlisi numèrica |
| Soggetto genere / forma | Revistes electròniques |
| ISSN | 1572-9044 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910138900603321 |
| [Amsterdam, the Netherlands], : Baltzer Science Publishers | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and computation : 17th international symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006 ; proceedings / / Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park (eds.)
| Algorithms and computation : 17th international symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006 ; proceedings / / Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XVIII, 465 p. 66 illus.) |
| Disciplina | 005.11 |
| Altri autori (Persone) | AsanoT <1949-> (Tetsuo) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Numerical calculations
Computer algorithms |
| ISBN |
1-280-39062-X
9786613568540 3-642-17517-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Regular Labelings and Geometric Structures -- Algorithmic Aspects of Secure Computation and Communication -- Session 1A. Approximation Algorithm I -- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament -- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 -- Approximate Periodicity -- Approximating the Average Stretch Factor of Geometric Graphs -- Session 1B. Complexity I -- Satisfiability with Index Dependency -- Anonymous Fuzzy Identity-Based Encryption for Similarity Search -- Improved Randomized Algorithms for 3-SAT -- Quantum Counterfeit Coin Problems -- Session 2A. Data Structure and Algorithm I -- Priority Range Trees -- Should Static Search Trees Ever Be Unbalanced? -- Levelwise Mesh Sparsification for Shortest Path Queries -- Unit-Time Predecessor Queries on Massive Data Sets -- Session 2B. Combinatorial Optimization -- Popularity at Minimum Cost -- Structural and Complexity Aspects of Line Systems of Graphs -- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra -- Generating Trees on Multisets -- Session 3A. Graph Algorithm I -- Seidel Minor, Permutation Graphs and Combinatorial Properties -- Simultaneous Interval Graphs -- Unbalanced Graph Partitioning -- On the Intersection of Tolerance and Cocomparability Graphs -- Flows in One-Crossing-Minor-Free Graphs -- Session 3B. Complexity II -- From Holant to #CSP and Back: Dichotomy for Holant c Problems -- Computing Sparse Multiples of Polynomials -- Fractal Parallelism: Solving SAT in Bounded Space and Time -- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity -- New Upper Bounds on the Average PTF Density of Boolean Functions -- Session 4A. Computational Geometry I -- An Optimal Algorithm for Computing Angle-Constrained Spanners -- Approximating Minimum Bending Energy Path in a Simple Corridor -- Session 4B. Graph Coloring I -- Analysis of an Iterated Local Search Algorithm for Vertex Coloring -- Bounded Max-colorings of Graphs -- Session 5A. Fixed Parameter Tractability -- Parameterized Algorithms for Boxicity -- On Tractable Cases of Target Set Selection -- Combining Two Worlds: Parameterised Approximation for Vertex Cover -- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time -- Session 5B. Optimization -- Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles -- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut -- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems -- A Faster Algorithm for the Maximum Even Factor Problem. |
| Altri titoli varianti | ISAAC 2006 |
| Record Nr. | UNINA-9910483655603321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and computation : 16th International Symposium, ISAAC 2005 : Sanya, Hainan, China, December 19-21, 2005 : proceedings / / Xiaotie Deng, Dingzhu Du (eds.)
| Algorithms and computation : 16th International Symposium, ISAAC 2005 : Sanya, Hainan, China, December 19-21, 2005 : proceedings / / Xiaotie Deng, Dingzhu Du (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XX, 1190 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DengXiaotie
DuDingzhu |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Numerical calculations |
| ISBN | 3-540-32426-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484526303321 |
| Berlin, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and computation : 15th international symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004 ; proceedings / / Rudolf Fleischer, Gerhard Trippen (eds.)
| Algorithms and computation : 15th international symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004 ; proceedings / / Rudolf Fleischer, Gerhard Trippen (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2004 |
| Descrizione fisica | 1 online resource (XVII, 935 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
FleischerRudolf <1964->
TrippenGerhard |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Numerical calculations
Computer algorithms |
| ISBN | 3-540-30551-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyline Fitting of Planar Points Under Min-sum Criteria -- A Generalization of Magic Squares with Applications to Digital Halftoning -- Voronoi Diagrams with a Transportation Network on the Euclidean Plane -- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation -- Poly-APX- and PTAS-Completeness in Standard and Differential Approximation -- Efficient Algorithms for k Maximum Sums -- Equipartitions of Measures by 2-Fans -- Augmenting the Edge-Connectivity of a Spider Tree -- On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks -- Structural Similarity in Graphs -- Flexibility of Steiner Trees in Uniform Orientation Metrics -- Random Access to Advice Strings and Collapsing Results -- Bounding the Payment of Approximate Truthful Mechanisms -- The Polymatroid Steiner Problems -- Geometric Optimization Problems Over Sliding Windows -- On-Line Windows Scheduling of Temporary Items -- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy -- An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem -- On the Range Maximum-Sum Segment Query Problem -- An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs -- Efficient Job Scheduling Algorithms with Multi-type Contentions -- Superimposing Voronoi Complexes for Shape Deformation -- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem -- Guarding Art Galleries by Guarding Witnesses -- On p-Norm Based Locality Measures of Space-Filling Curves -- Composability of Infinite-State Activity Automata -- Error Compensation in Leaf Root Problems -- On Compact and Efficient Routing in Certain Graph Classes -- Randomized Insertion and Deletion in Point Quad Trees -- Diagnosis in the Presence of Intermittent Faults -- Three-Round Adaptive Diagnosis in Binary n-Cubes -- Fast Algorithms for Comparison of Similar Unordered Trees -- GCD of Random Linear Forms -- On the Hardness and Easiness of Random 4-SAT Formulas -- Minimum Common String Partition Problem: Hardness and Approximations -- On the Complexity of Network Synchronization -- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs -- Adaptive Spatial Partitioning for Multidimensional Data Streams -- Paired Pointset Traversal -- Approximated Two Choices in Randomized Load Balancing -- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting -- Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs -- The Maximum Agreement of Two Nested Phylogenetic Networks -- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations -- New Bounds on Map Labeling with Circular Labels -- Optimal Buffer Management via Resource Augmentation -- Oriented Paths in Mixed Graphs -- Polynomial Deterministic Rendezvous in Arbitrary Graphs -- Distributions of Points and Large Quadrangles -- Cutting Out Polygons with Lines and Rays -- Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays -- Inner Rectangular Drawings of Plane Graphs -- Approximating the Minmax Subtree Cover Problem in a Cactus -- Boundary-Optimal Triangulation Flooding -- Exact Computation of Polynomial Zeros Expressible by Square Roots -- Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees -- Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks -- Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search -- Dynamic Tree Cross Products -- Spanners, Weak Spanners, and Power Spanners for Wireless Networks -- Techniques for Indexing and Querying Temporal Observations for a Collection of Objects -- Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices -- The Two-Guard Problem Revisited and Its Generalization -- Canonical Data Structure for Interval Probe Graphs -- Efficient Algorithms for the Longest Path Problem -- Randomized Algorithms for Motif Detection -- Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation -- Sweeping Graphs with Large Clique Number -- A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. |
| Altri titoli varianti | ISAAC 2004 |
| Record Nr. | UNINA-9910483967303321 |
| Berlin ; ; New York, : Springer, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applied Computational Electromagnetics Society journal
| Applied Computational Electromagnetics Society journal |
| Pubbl/distr/stampa | [Monterey, CA?], : The Society |
| Disciplina | 537 |
| Soggetto topico |
Electromagnetism
Numerical calculations Électromagnétisme Calculs numériques |
| Soggetto genere / forma | Periodicals. |
| ISSN | 1943-5711 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Journal
ACES journal |
| Record Nr. | UNINA-9910338721803321 |
| [Monterey, CA?], : The Society | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational mathematics in China / Zhong-Ci Shi and Chung-Chun Yang, editors
| Computational mathematics in China / Zhong-Ci Shi and Chung-Chun Yang, editors |
| Autore | Shih, Chung-tzù |
| Pubbl/distr/stampa | Providence, R.I. : American Mathematical Society, c1994 |
| Descrizione fisica | xii, 225 p. ; 26 cm |
| Disciplina | 519.4 |
| Altri autori (Persone) | Yang, Chung-Chunauthor |
| Collana | Contemporary mathematics, 0271-4132 ; 163 |
| Soggetto topico |
Mathematics-China-data processing
Numerical analysis Numerical calculations |
| ISBN | 0821851632 |
| Classificazione |
AMS 01A25
AMS 62-02 AMS 65-06 LC QA297.C634 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000774659707536 |
Shih, Chung-tzù
|
||
| Providence, R.I. : American Mathematical Society, c1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Computational mathematics in China / / Zhong-Ci Shi and Chung-Chun Yang, editors
| Computational mathematics in China / / Zhong-Ci Shi and Chung-Chun Yang, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1994] |
| Descrizione fisica | 1 online resource (xii, 225 p. ) |
| Disciplina | 519.4 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Numerical calculations
Mathematics - China - Data processing |
| Soggetto genere / forma | Electronic books. |
| ISBN |
0-8218-7754-2
0-8218-5163-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910480705203321 |
| Providence, Rhode Island : , : American Mathematical Society, , [1994] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational mathematics in China / / Zhong-Ci Shi and Chung-Chun Yang, editors
| Computational mathematics in China / / Zhong-Ci Shi and Chung-Chun Yang, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1994] |
| Descrizione fisica | 1 online resource (xii, 225 p. ) |
| Disciplina | 519.4 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Numerical calculations
Mathematics - China - Data processing |
| ISBN |
0-8218-7754-2
0-8218-5163-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910788643903321 |
| Providence, Rhode Island : , : American Mathematical Society, , [1994] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational mathematics in China / / Zhong-Ci Shi and Chung-Chun Yang, editors
| Computational mathematics in China / / Zhong-Ci Shi and Chung-Chun Yang, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1994] |
| Descrizione fisica | 1 online resource (xii, 225 p. ) |
| Disciplina | 519.4 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Numerical calculations
Mathematics - China - Data processing |
| ISBN |
0-8218-7754-2
0-8218-5163-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910827541003321 |
| Providence, Rhode Island : , : American Mathematical Society, , [1994] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
