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 Computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II / / edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park
| Algorithms and Computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II / / edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XVIII, 474 p. 96 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Artificial intelligence—Data processing Programming Techniques Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Data Science |
| ISBN |
1-280-39061-1
9786613568533 3-642-17514-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 6A. Data Structure and Algorithm II -- D2-Tree: A New Overlay with Deterministic Bounds -- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets -- Dynamic Range Reporting in External Memory -- A Cache-Oblivious Implicit Dictionary with the Working Set Property -- Session 6B. Graph Algorithm II -- The (p,q)-total Labeling Problem for Trees -- Drawing a Tree as a Minimum Spanning Tree Approximation -- k-cyclic Orientations of Graphs -- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size -- Session 7A. Computational Geometry II -- Maximum Overlap of Convex Polytopes under Translation -- Approximate Shortest Homotopic Paths in Weighted Regions -- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane -- Session 7B. Graph Coloring II -- Approximation and Hardness Results for the Maximum Edge q-coloring Problem -- 3-Colouring AT-Free Graphs in Polynomial Time -- On Coloring Graphs without Induced Forests -- Session 8A. Approximation Algorithm II -- On the Approximability of the Maximum Interval Constrained Coloring Problem -- Approximability of Constrained LCS -- Approximation Algorithms for the Multi-Vehicle Scheduling Problem -- On Greedy Algorithms for Decision Trees -- Session 8B. Online Algorithm -- Single and Multiple Device DSA Problem, Complexities and Online Algorithms -- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications -- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing -- On the Continuous CNN Problem -- Session 9A. Scheduling -- Policies for Periodic Packet Routing -- Increasing Speed Scheduling and Flow Scheduling -- A Tighter Analysis of Work Stealing -- Approximating the Traveling Tournament Problem with Maximum Tour Length 2 -- Session 9B. Data Structure and Algorithm III -- Alphabet Partitioning for Compressed Rank/Select and Applications -- Entropy-Bounded Representation of Point Grids -- Identifying Approximate Palindromes in Run-Length Encoded Strings -- Session 10A. Graph Algorithm III -- Minimum Cost Partitions of Trees with Supply and Demand -- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application -- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs -- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization -- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs -- Session 10B. Computational Geometry III -- Testing Simultaneous Planarity When the Common Graph Is 2-Connected -- Computing the Discrete Fréchet Distance with Imprecise Input -- Connectivity Graphs of Uncertainty Regions -- ?/2-Angle Yao Graphs Are Spanners -- Identifying Shapes Using Self-assembly. |
| Record Nr. | UNISA-996466014303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I / / edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park
| Algorithms and Computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I / / edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XVIII, 465 p. 66 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Artificial intelligence—Data processing Programming Techniques Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Data Science |
| 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. |
| Record Nr. | UNISA-996466010103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010 ; Jeju Island, Korea, December 15-17, 2010 : proceedings . Part II / / Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park (eds.)
| Algorithms and computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010 ; Jeju Island, Korea, December 15-17, 2010 : proceedings . Part II / / Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XVIII, 474 p. 96 illus.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
CheongOtfried
ChwaKyung-Yong <1946-> ParkKunsoo |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Numerical calculations - Data processing |
| ISBN |
1-280-39061-1
9786613568533 3-642-17514-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 6A. Data Structure and Algorithm II -- D2-Tree: A New Overlay with Deterministic Bounds -- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets -- Dynamic Range Reporting in External Memory -- A Cache-Oblivious Implicit Dictionary with the Working Set Property -- Session 6B. Graph Algorithm II -- The (p,q)-total Labeling Problem for Trees -- Drawing a Tree as a Minimum Spanning Tree Approximation -- k-cyclic Orientations of Graphs -- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size -- Session 7A. Computational Geometry II -- Maximum Overlap of Convex Polytopes under Translation -- Approximate Shortest Homotopic Paths in Weighted Regions -- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane -- Session 7B. Graph Coloring II -- Approximation and Hardness Results for the Maximum Edge q-coloring Problem -- 3-Colouring AT-Free Graphs in Polynomial Time -- On Coloring Graphs without Induced Forests -- Session 8A. Approximation Algorithm II -- On the Approximability of the Maximum Interval Constrained Coloring Problem -- Approximability of Constrained LCS -- Approximation Algorithms for the Multi-Vehicle Scheduling Problem -- On Greedy Algorithms for Decision Trees -- Session 8B. Online Algorithm -- Single and Multiple Device DSA Problem, Complexities and Online Algorithms -- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications -- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing -- On the Continuous CNN Problem -- Session 9A. Scheduling -- Policies for Periodic Packet Routing -- Increasing Speed Scheduling and Flow Scheduling -- A Tighter Analysis of Work Stealing -- Approximating the Traveling Tournament Problem with Maximum Tour Length 2 -- Session 9B. Data Structure and Algorithm III -- Alphabet Partitioning for Compressed Rank/Select and Applications -- Entropy-Bounded Representation of Point Grids -- Identifying Approximate Palindromes in Run-Length Encoded Strings -- Session 10A. Graph Algorithm III -- Minimum Cost Partitions of Trees with Supply and Demand -- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application -- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs -- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization -- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs -- Session 10B. Computational Geometry III -- Testing Simultaneous Planarity When the Common Graph Is 2-Connected -- Computing the Discrete Fréchet Distance with Imprecise Input -- Connectivity Graphs of Uncertainty Regions -- ?/2-Angle Yao Graphs Are Spanners -- Identifying Shapes Using Self-assembly. |
| Altri titoli varianti | ISAAC 2010 |
| Record Nr. | UNINA-9910483655503321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the sixteenth annual Symposium on Computational Geometry
| Proceedings of the sixteenth annual Symposium on Computational Geometry |
| Autore | Cheng Siu-Wing |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2000 |
| Descrizione fisica | 1 online resource (379 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Mathematics
Physical Sciences & Mathematics Geometry |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | SoCG 2000 the 16th annual ACM Symposium on Computational Geometry, Clear Water Bay, Hong Kong - June 12 - 14, 2000 |
| Record Nr. | UNINA-9910376217203321 |
Cheng Siu-Wing
|
||
| [Place of publication not identified], : ACM, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||