Overview

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.

Full Product Details

Author:   Michael H. Goldwasser ,  David Johnson ,  Catherine C. McGeoch
Publisher:   American Mathematical Society
Imprint:   American Mathematical Society
Volume:   No. 59
Weight:   0.682kg
ISBN:  

9780821828922

ISBN 10:   0821828924
Pages:   256
Publication Date:   01 May 2006
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Temporarily unavailable  
The supplier advises that this item is temporarily unavailable. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out to you.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions