Vladimir estivill (24 resultados)

Paperback. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: new. Paperback. This book constitutes the refereed proceedings of the 16th International Conference on Similarity Search and Applications, SISAP 2023, held in A Coruna, Spain, during October 911, 2023.The 16 full papers and 4 short papers included in this book were carefully reviewed and selected from 33 submissions. They were organized in topical sections as follows: similarity queries, similarity measures, indexing and retrieval, data management, feature extraction, intrinsic dimensionality, efficient algorithms, similarity in machine learning and data mining. This book constitutes the refereed proceedings of the 16th International Conference on Similarity Search and Applications, SISAP 2023, held in A Coruna, Spain, during October 911, 2023.The 16 full papers and 4 short papers included in this book were carefully reviewed and selected from 33 submissions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Condición: New.

Paperback. Condición: New. 2000 ed. The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is \Approximating Uniform TriangularMeshes in Polygons"byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper \Maximum Induced Matchings of Random Cubic Graphs".We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.…

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Kartoniert / Broschiert. Condición: New.

Paperback. Condición: Brand New. 331 pages. 9.26x6.10x0.70 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 16th International ConferenceonSimilarity Search and Applications, SISAP 2023, held in A Coruña, Spain,during October 9-11, 2023.The 16 full papers and 4 short papers included in this book were carefully reviewed andselected from 33 submissions. They were organized in topical sections as follows: similarity queries, similarity measures, indexing and retrieval, data management, feature extraction, intrinsic dimensionality, efficient algorithms, similarity in machine learning and data mining.…

Paperback. Condición: new. Paperback. This book constitutes the refereed proceedings of the 16th International Conference on Similarity Search and Applications, SISAP 2023, held in A Coruna, Spain, during October 911, 2023.The 16 full papers and 4 short papers included in this book were carefully reviewed and selected from 33 submissions. They were organized in topical sections as follows: similarity queries, similarity measures, indexing and retrieval, data management, feature extraction, intrinsic dimensionality, efficient algorithms, similarity in machine learning and data mining. This book constitutes the refereed proceedings of the 16th International Conference on Similarity Search and Applications, SISAP 2023, held in A Coruna, Spain, during October 911, 2023.The 16 full papers and 4 short papers included in this book were carefully reviewed and selected from 33 submissions. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Paperback. Condición: New. 2000 ed. The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is \Approximating Uniform TriangularMeshes in Polygons"byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper \Maximum Induced Matchings of Random Cubic Graphs".We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.…

PF. Condición: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condición: new. Questo è un articolo print on demand.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is Approximating Uniform TriangularMeshes in Polygons'byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper Maximum Induced Matchings of Random Cubic Graphs'. We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance. 496 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 16th International ConferenceonSimilarity Search and Applications, SISAP 2023, held in A Coruña, Spain,during October 9-11, 2023.The 16 full papers and 4 short papers included in this book were carefully reviewed andselected from 33 submissions. They were organized in topical sections as follows: similarity queries, similarity measures, indexing and retrieval, data management, feature extraction, intrinsic dimensionality, efficient algorithms, similarity in machine learning and data mining. 332 pp. Englisch.…

Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes supplementary material: sn.pub/extrasInvited Talks.- Theoretical Problems Related to the Internet.- Recent Progress and Prospects for Integer Factorisation Algorithms.- Hao Wang Award Paper.- Approximating Uniform Triangular Meshes in Po.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 496 pp. Englisch.…

Taschenbuch. Condición: Neu. Computing and Combinatorics | 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings | Ding-Zhu Du (u. a.) | Taschenbuch | xii | Englisch | 2000 | Springer | EAN 9783540677871 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -¿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-SharingTandems 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 332 pp. Englisch.…