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.
Algorithms and Data Structures [[electronic resource] ] : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh
| Algorithms and Data Structures [[electronic resource] ] : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 664 p.) |
| Disciplina | 005.73 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Programming Techniques Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis |
| ISBN | 3-540-73951-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Finding Small Holes -- Session 2A -- Approximate Range Searching: The Absolute Model -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- Session 2B -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Approximating the Maximum Sharing Problem -- The Stackelberg Minimum Spanning Tree Game -- Session 3A -- Edges and Switches, Tunnels and Bridges -- How to Draw a Clustered Tree -- Drawing Colored Graphs on Colored Points -- Session 3B -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Priority Queues Resilient to Memory Faults -- Simple and Space-Efficient Minimal Perfect Hash Functions -- Session 4A -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems -- Optimization for First Order Delaunay Triangulations -- Session 4B -- Constant Factor Approximations for the Hotlink Assignment Problem -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- A Stab at Approximating Minimum Subadditive Join -- Session 5 -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Session 6A -- Flooding Countries and Destroying Dams -- I/O-Efficient Flow Modeling on Fat Terrains -- Computing the Visibility Map of Fat Objects -- Session 6B -- Independent Sets in Bounded-Degree Hypergraphs -- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time -- Session 7A -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Spanners for Geometric Intersection Graphs -- On Generalized Diamond Spanners -- Session 7B -- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- On the Robustness of Graham’s Algorithm for Online Scheduling -- Improved Results for a Memory Allocation Problem -- Session 8A -- Computational and Structural Advantages of Circular Boundary Representation -- Alpha-Beta Witness Complexes -- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra -- Session 8B -- Fixed-Parameter Tractability for Non-Crossing Spanning Trees -- Improved Algorithms for the Feedback Vertex Set Problems -- Kernelization Algorithms for d-Hitting Set Problems -- Session 9A -- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points -- Maximizing Maximal Angles for Plane Straight-Line Graphs -- Cuttings for Disks and Axis-Aligned Rectangles -- Session 9B -- Kernelization and Complexity Results for Connectivity Augmentation Problems -- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem -- Branch and Recharge: Exact Algorithms for Generalized Domination -- Session 10A -- On Computing the Centroid of the Vertices of an Arrangement and Related Problems -- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p -- Session 10B -- Faster Approximation of Distances in Graphs -- Approximate Shortest Paths Guided by a Small Index -- Session 11A -- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model -- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field -- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality -- On Euclidean Vehicle Routing with Allocation -- Session 11B -- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets -- Range Non-overlapping Indexing and Successive List Indexing -- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters -- Dynamic TCP Acknowledgment with Sliding Window. |
| Record Nr. | UNISA-996466340203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh
| Algorithms and Data Structures : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 664 p.) |
| Disciplina | 005.73 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Programming Techniques Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis |
| ISBN | 3-540-73951-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Finding Small Holes -- Session 2A -- Approximate Range Searching: The Absolute Model -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- Session 2B -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Approximating the Maximum Sharing Problem -- The Stackelberg Minimum Spanning Tree Game -- Session 3A -- Edges and Switches, Tunnels and Bridges -- How to Draw a Clustered Tree -- Drawing Colored Graphs on Colored Points -- Session 3B -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Priority Queues Resilient to Memory Faults -- Simple and Space-Efficient Minimal Perfect Hash Functions -- Session 4A -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems -- Optimization for First Order Delaunay Triangulations -- Session 4B -- Constant Factor Approximations for the Hotlink Assignment Problem -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- A Stab at Approximating Minimum Subadditive Join -- Session 5 -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Session 6A -- Flooding Countries and Destroying Dams -- I/O-Efficient Flow Modeling on Fat Terrains -- Computing the Visibility Map of Fat Objects -- Session 6B -- Independent Sets in Bounded-Degree Hypergraphs -- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time -- Session 7A -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Spanners for Geometric Intersection Graphs -- On Generalized Diamond Spanners -- Session 7B -- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- On the Robustness of Graham’s Algorithm for Online Scheduling -- Improved Results for a Memory Allocation Problem -- Session 8A -- Computational and Structural Advantages of Circular Boundary Representation -- Alpha-Beta Witness Complexes -- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra -- Session 8B -- Fixed-Parameter Tractability for Non-Crossing Spanning Trees -- Improved Algorithms for the Feedback Vertex Set Problems -- Kernelization Algorithms for d-Hitting Set Problems -- Session 9A -- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points -- Maximizing Maximal Angles for Plane Straight-Line Graphs -- Cuttings for Disks and Axis-Aligned Rectangles -- Session 9B -- Kernelization and Complexity Results for Connectivity Augmentation Problems -- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem -- Branch and Recharge: Exact Algorithms for Generalized Domination -- Session 10A -- On Computing the Centroid of the Vertices of an Arrangement and Related Problems -- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p -- Session 10B -- Faster Approximation of Distances in Graphs -- Approximate Shortest Paths Guided by a Small Index -- Session 11A -- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model -- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field -- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality -- On Euclidean Vehicle Routing with Allocation -- Session 11B -- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets -- Range Non-overlapping Indexing and Successive List Indexing -- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters -- Dynamic TCP Acknowledgment with Sliding Window. |
| Record Nr. | UNINA-9910483608203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia
| Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York ; ; Amsterdam, : Elsevier, 2000 |
| Descrizione fisica | 1 online resource (1087 p.) |
| Disciplina |
516.00285
516/.00285 21 |
| Altri autori (Persone) |
SackJ.-R <1954-> (Jörg-Rüdiger)
UrrutiaJ (Jorge) |
| Soggetto topico |
Geometry - Data processing
Computer graphics Combinatorial geometry |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-05842-4
9786611058425 0-08-052968-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Handbook of Computational Geometry; Copyright Page; Preface; List of Contributors; Contents; Chapter 1. Davenport-Schinzel sequences and their geometric applications; Chapter 2. Arrangements and their applications; Chapter 3. Discrete geometric shapes: Matching, interpolation, and approximation; Chapter 4. Deterministic parallel computational geometry; chapter 5. Voronoi diagrams; Chapter 6. Mesh generation; Chapter 7. Applications of computational geometry to geographic information systems
Chapter 8. Making geometry visible: An introduction to the animation of geometric algorithmsChapter 9. Spanning trees and spanners; Chapter 10. Geometric data structures; Chapter 11. Polygon decomposition; Chapter 12. Link distance problems; Chapter 13. Derandomization in computational geometry; Chapter 14. Robustness and precision issues in geometric computation; Chapter 15. Geometric shortest paths and network optimization; Chapter 16. Randomized algorithms in computational geometry; Chapter 17. Spatial data structures: Concepts and design choices Chapter 18. Parallel computational geometry: An approach using randomizationChapter 19. Visibility in the plane; Chapter 20. Closest-point problems in computational geometry; Chapter 21. Graph drawing; Chapter 22. Art gallery and illumination problems; Author Index; Subject Index |
| Record Nr. | UNINA-9910511322503321 |
| New York ; ; Amsterdam, : Elsevier, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia
| Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York ; ; Amsterdam, : Elsevier, 2000 |
| Descrizione fisica | 1 online resource (1087 p.) |
| Disciplina |
516.00285
516/.00285 21 |
| Altri autori (Persone) |
SackJ.-R <1954-> (Jörg-Rüdiger)
UrrutiaJ (Jorge) |
| Soggetto topico |
Geometry - Data processing
Computer graphics Combinatorial geometry |
| ISBN |
1-281-05842-4
9786611058425 0-08-052968-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Handbook of Computational Geometry; Copyright Page; Preface; List of Contributors; Contents; Chapter 1. Davenport-Schinzel sequences and their geometric applications; Chapter 2. Arrangements and their applications; Chapter 3. Discrete geometric shapes: Matching, interpolation, and approximation; Chapter 4. Deterministic parallel computational geometry; chapter 5. Voronoi diagrams; Chapter 6. Mesh generation; Chapter 7. Applications of computational geometry to geographic information systems
Chapter 8. Making geometry visible: An introduction to the animation of geometric algorithmsChapter 9. Spanning trees and spanners; Chapter 10. Geometric data structures; Chapter 11. Polygon decomposition; Chapter 12. Link distance problems; Chapter 13. Derandomization in computational geometry; Chapter 14. Robustness and precision issues in geometric computation; Chapter 15. Geometric shortest paths and network optimization; Chapter 16. Randomized algorithms in computational geometry; Chapter 17. Spatial data structures: Concepts and design choices Chapter 18. Parallel computational geometry: An approach using randomizationChapter 19. Visibility in the plane; Chapter 20. Closest-point problems in computational geometry; Chapter 21. Graph drawing; Chapter 22. Art gallery and illumination problems; Author Index; Subject Index |
| Record Nr. | UNINA-9910783135303321 |
| New York ; ; Amsterdam, : Elsevier, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||