Data Structures, Near Neighbor Searches and Methodology
Fifth and Sixth DIMACS Implementation Challenges
Will be published approx. on 30. December 2002
Book
Hardback
978-0-8218-2892-2 (ISBN)
Description
This book presents reviewed and revised papers from the fifth and sixth DIMACS Implementation Challenge workshops. These workshops, held approximately annually, aim at encouraging high-quality work in experimental analysis of data structures and algorithms. The papers published in this volume are the results of year-long coordinated research projects and contain new findings and insights. Three papers address the performance evaluation of implementations for two fundamental data structures, dictionaries and priority queues, as used in the context of real applications. Another four papers consider the still evolving topic of methodologies for experimental algorithmics. Five papers are concerned with implementations of algorithms for nearest neighbor search in high dimensional spaces, an area with applications in information retrieval and data mining on collections of Web documents, DNA sequences, images and various other data types.
More details
Series
Language
English
Place of publication
Providence
United States
Target group
Professional and scholarly
Illustrations
bibliography
Weight
682 gr
ISBN-13
978-0-8218-2892-2 (9780821828922)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
Partially persistent dynamic sets for history-sensitive heuristics by R. Battiti A practical perfect hashing algorithm by C. Silverstein Computational evaluation of hot queues by A. V. Goldberg and C. Silverstein Nearest neighbor search for data compression by K. Zatloukal, M. H. Johnson, and R. E. Ladner Experimental evaluation of disk-based data structures for nearest neighbor searching by N. Katayama and S. Satoh Analysis of approximate nearest neighbor searching with clustered point sets by S. Maneewongvatana and D. M. Mount Approximate nearest neighbor search using the extended general space-filling curves heuristic by J.-C. Perez-Cortes and E. Vidal Locally lifting the curse of dimensionality for nearest neighbor search by P. N. Yianilos The role of experiment in the theory of algorithms by R. J. Anderson Towards a discipline of experimental algorithmics by B. M. E. Moret A theoretician's guide to the experimental analysis of algorithms by D. S. Johnson A bibliography of algorithm experimentation by C. C. McGeoch.