Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth Dimacs Implementation Challenges : Papers Related to the Dimacs Challenge on ... and Theoretical Computer Science, 59)

by Michael H. Goldwasser (Editor), Michael H. Goldwasser (Editor), David S. Johnson (Editor)

The 11 papers are from two one in 1995-95 on dictionaries and priority queues, and the other in 1998-99 on near neighbor searches, the fifth and sixth DIMACS Algorithm Implementation Challenges initiated in 1991. They address those challenges with considerations of a practical perfect hashing algorithm, locally lifting the curse of dimensionality for a nearest neighbor search, and other topics. They also discuss methodology for the experimental analysis of algorithms. They are not indexed. Annotation c. Book News, Inc., Portland, OR (booknews.com)

256 pages, Hardcover

First published December 1, 2002