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.
Computing and Combinatorics [[electronic resource] ] : 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings / / edited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma
| Computing and Combinatorics [[electronic resource] ] : 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings / / edited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 478 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Application software Algorithms Computer science—Mathematics Computer graphics Programming Techniques Theory of Computation Computer Applications Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-44968-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Hao Wang Award Paper -- Approximating Uniform Triangular Meshes in Polygons -- The Best Young Researcher Paper -- Maximum Induced Matchings of Random Cubic Graphs -- Computational Geometry 1 -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Graph Drawing -- Embedding Problems for Paths with Direction Constrained Edges -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Graph Theory and Algorithms 1 -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Complexity, Discrete Mathematics, and Number Theory -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Algorithms -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines -- Parallel and Distributed Computing -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications -- Efficient List Ranking Algorithms on Reconfigurable Mesh -- Computational Geometry 2 -- Tripods Do Not Pack Densely -- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line -- Tetrahedralization of Two Nested Convex Polyhedra -- Efficient Algorithms for Two-Center Problems for a Convex Polygon -- Combinatorial Optimization -- On Computation of Arbitrage for Markets with Friction -- On Some Optimization Problems in Obnoxious Facility Location -- Generating Necklaces and Strings with Forbidden Substrings -- Optimal Labelling of Point Features in the Slider Model -- Data Structures and Computational Biology -- Mappings for Conflict-Free Access of Paths in Elementary Data Structures -- Theory of Trinomial Heaps -- Polyhedral Aspects of the Consecutive Ones Problem -- The Complexity of Physical Mapping with Strict Chimerism -- Learning and Cryptography -- Logical Analysis of Data with Decomposable Structures -- Learning from Approximate Data -- A Combinatorial Approach to Asymmetric Traitor Tracing -- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs -- Automata and Quantum Computing -- One-Way Probabilistic Reversible and Quantum One-Counter Automata -- Similarity Enrichment in Image Compression through Weighted Finite Automata -- On the Power of Input-Synchronized Alternating Finite Automata -- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. |
| Record Nr. | UNISA-996465560403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings / / edited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma
| Computing and Combinatorics : 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings / / edited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 478 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Application software Algorithms Computer science—Mathematics Computer graphics Programming Techniques Theory of Computation Computer Applications Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-44968-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Hao Wang Award Paper -- Approximating Uniform Triangular Meshes in Polygons -- The Best Young Researcher Paper -- Maximum Induced Matchings of Random Cubic Graphs -- Computational Geometry 1 -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Graph Drawing -- Embedding Problems for Paths with Direction Constrained Edges -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Graph Theory and Algorithms 1 -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Complexity, Discrete Mathematics, and Number Theory -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Algorithms -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines -- Parallel and Distributed Computing -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications -- Efficient List Ranking Algorithms on Reconfigurable Mesh -- Computational Geometry 2 -- Tripods Do Not Pack Densely -- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line -- Tetrahedralization of Two Nested Convex Polyhedra -- Efficient Algorithms for Two-Center Problems for a Convex Polygon -- Combinatorial Optimization -- On Computation of Arbitrage for Markets with Friction -- On Some Optimization Problems in Obnoxious Facility Location -- Generating Necklaces and Strings with Forbidden Substrings -- Optimal Labelling of Point Features in the Slider Model -- Data Structures and Computational Biology -- Mappings for Conflict-Free Access of Paths in Elementary Data Structures -- Theory of Trinomial Heaps -- Polyhedral Aspects of the Consecutive Ones Problem -- The Complexity of Physical Mapping with Strict Chimerism -- Learning and Cryptography -- Logical Analysis of Data with Decomposable Structures -- Learning from Approximate Data -- A Combinatorial Approach to Asymmetric Traitor Tracing -- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs -- Automata and Quantum Computing -- One-Way Probabilistic Reversible and Quantum One-Counter Automata -- Similarity Enrichment in Image Compression through Weighted Finite Automata -- On the Power of Input-Synchronized Alternating Finite Automata -- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. |
| Record Nr. | UNINA-9910143626903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Similarity Search and Applications [[electronic resource] ] : 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings / / edited by Oscar Pedreira, Vladimir Estivill-Castro
| Similarity Search and Applications [[electronic resource] ] : 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings / / edited by Oscar Pedreira, Vladimir Estivill-Castro |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (325 pages) |
| Disciplina | 943.005 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Information storage and retrieval systems
Database management Data mining Machine learning Application software Information Storage and Retrieval Database Management Data Mining and Knowledge Discovery Machine Learning Computer and Information Systems Applications |
| ISBN | 3-031-46994-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynotes -- From Intrinsic Dimensionality to Chaos and Control: Towards a Unified Theoretical View -- The Rise of HNSW: Understanding Key Factors Driving the Adoption -- Towards a Universal Similarity Function: the Information Contrast Model and its Application as Evaluation Metric in Artificial Intelligence Tasks -- Research Track -- Finding HSP Neighbors via an Exact, Hierarchical Approach -- Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash -- Mutual nearest neighbor graph for data analysis: Application to metric space clustering -- An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity Search -- Unbiased Similarity Estimators using Samples -- Retrieve-and-Rank End-to-End Summarization of Biomedical Studies -- Fine-grained Categorization of Mobile Applications through Semantic Similarity Techniques for Apps Classification -- Runs of Side-Sharing Tandems in Rectangular Arrays -- Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions -- Class Representatives Selection in Non-Metric Spaces for Nearest Prototype Classification -- The Dataset-similarity-based Approach to Select Datasets for Evaluation in Similarity Retrieval -- Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback -- Accelerating k-Means Clustering with Cover Trees -- Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index Quality -- Minwise-Independent Permutations with Insertion and Deletion of Features -- SDOclust: Clustering with Sparse Data Observers -- Solving k-Closest Pairs in High-Dimensional Data using Locality- Sensitive Hashing -- Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information Retrieval -- Similarity Search with Multiple-Object Queries -- Diversity Similarity Join for Big Data -- Indexing Challenge -- Overview of the SISAP 2023 Indexing Challenge -- Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, And Batch Extraction -- General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo -- SISAP 2023 Indexing Challenge – Learned Metric Index -- Computational Enhancements of HNSW Targeted to Very Large Datasets -- CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP Vectors. |
| Record Nr. | UNISA-996558465403316 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Similarity Search and Applications : 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings / / edited by Oscar Pedreira, Vladimir Estivill-Castro
| Similarity Search and Applications : 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings / / edited by Oscar Pedreira, Vladimir Estivill-Castro |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (325 pages) |
| Disciplina | 943.005 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Information storage and retrieval systems
Database management Data mining Machine learning Application software Information Storage and Retrieval Database Management Data Mining and Knowledge Discovery Machine Learning Computer and Information Systems Applications |
| ISBN | 3-031-46994-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynotes -- From Intrinsic Dimensionality to Chaos and Control: Towards a Unified Theoretical View -- The Rise of HNSW: Understanding Key Factors Driving the Adoption -- Towards a Universal Similarity Function: the Information Contrast Model and its Application as Evaluation Metric in Artificial Intelligence Tasks -- Research Track -- Finding HSP Neighbors via an Exact, Hierarchical Approach -- Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash -- Mutual nearest neighbor graph for data analysis: Application to metric space clustering -- An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity Search -- Unbiased Similarity Estimators using Samples -- Retrieve-and-Rank End-to-End Summarization of Biomedical Studies -- Fine-grained Categorization of Mobile Applications through Semantic Similarity Techniques for Apps Classification -- Runs of Side-Sharing Tandems in Rectangular Arrays -- Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions -- Class Representatives Selection in Non-Metric Spaces for Nearest Prototype Classification -- The Dataset-similarity-based Approach to Select Datasets for Evaluation in Similarity Retrieval -- Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback -- Accelerating k-Means Clustering with Cover Trees -- Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index Quality -- Minwise-Independent Permutations with Insertion and Deletion of Features -- SDOclust: Clustering with Sparse Data Observers -- Solving k-Closest Pairs in High-Dimensional Data using Locality- Sensitive Hashing -- Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information Retrieval -- Similarity Search with Multiple-Object Queries -- Diversity Similarity Join for Big Data -- Indexing Challenge -- Overview of the SISAP 2023 Indexing Challenge -- Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, And Batch Extraction -- General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo -- SISAP 2023 Indexing Challenge – Learned Metric Index -- Computational Enhancements of HNSW Targeted to Very Large Datasets -- CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP Vectors. |
| Record Nr. | UNINA-9910755085903321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||