DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 59; 2002; 256 pp; Hardcover
MSC: Primary 68;
Print ISBN: 978-0-8218-2892-2
Product Code: DIMACS/59
List Price: $96.00
Individual Member Price: $76.80
You may also like
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation ChallengesShare this page
Edited by Michael H. Goldwasser; David S. Johnson; Catherine C. McGeoch
A co-publication of the AMS and DIMACS
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.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Table of Contents
Table of Contents
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges
Graduate students and researchers interested in algorithms and their experimental analysis; engineers working on algorithms for data processing.