Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821828922, 9781470440176

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A bibliography of algorithm experimentation

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/12 ◽

2002 ◽

pp. 251-256 ◽

Cited By ~ 3

Author(s):

Catherine McGeoch

Download Full-text

Nearest neighbor search for data compression

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/04 ◽

2002 ◽

pp. 69-86 ◽

Cited By ~ 4

Author(s):

Kevin Zatloukal ◽

Mary Johnson ◽

Richard Ladner

Keyword(s):

Data Compression ◽

Nearest Neighbor ◽

Nearest Neighbor Search ◽

Neighbor Search

Download Full-text

Computational evaluation of hot queues

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/03 ◽

2002 ◽

pp. 49-67

Author(s):

Andrew Goldberg ◽

Craig Silverstein

Keyword(s):

Computational Evaluation

Download Full-text

Analysis of approximate nearest neighbor searching with clustered point sets

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/06 ◽

2002 ◽

pp. 105-123 ◽

Cited By ~ 4

Author(s):

Songrit Maneewongvatana ◽

David Mount

Keyword(s):

Nearest Neighbor ◽

Point Sets ◽

Approximate Nearest Neighbor ◽

Nearest Neighbor Searching

Download Full-text

Approximate nearest neighbor search using the extended general space-filling curves heuristic

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/07 ◽

2002 ◽

pp. 125-175

Author(s):

Juan-Carlos Perez-Cortes ◽

Enrique Vidal

Keyword(s):

Nearest Neighbor ◽

Nearest Neighbor Search ◽

Space Filling ◽

Approximate Nearest Neighbor Search ◽

Space Filling Curves ◽

Approximate Nearest Neighbor ◽

General Space ◽

Neighbor Search

Download Full-text

A practical perfect hashing algorithm

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/02 ◽

2002 ◽

pp. 23-47 ◽

Cited By ~ 2

Author(s):

Craig Silverstein

Keyword(s):

Hashing Algorithm ◽

Perfect Hashing

Download Full-text

A theoretician’s guide to the experimental analysis of algorithms

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/11 ◽

2002 ◽

pp. 215-250 ◽

Cited By ~ 59

Author(s):

David Johnson

Keyword(s):

Experimental Analysis ◽

Analysis Of Algorithms ◽

Experimental Analysis Of Algorithms

Download Full-text

Towards a discipline of experimental algorithmics

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/10 ◽

2002 ◽

pp. 197-213 ◽

Cited By ~ 23

Author(s):

Bernard Moret

Keyword(s):

Experimental Algorithmics

Download Full-text

Locally lifting the curse of dimensionality for nearest neighbor search

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/08 ◽

2002 ◽

pp. 177-190 ◽

Cited By ~ 1

Author(s):

Peter Yianilos

Keyword(s):

Nearest Neighbor ◽

Curse Of Dimensionality ◽

Nearest Neighbor Search ◽

Neighbor Search

Download Full-text

Experimental evaluation of disk-based data structures for nearest neighbor searching

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/059/05 ◽

2002 ◽

pp. 87-104

Author(s):

Norio Katayama ◽

Shin’ichi Satoh

Keyword(s):

Data Structures ◽

Experimental Evaluation ◽

Nearest Neighbor ◽

Nearest Neighbor Searching

Download Full-text

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

A bibliography of algorithm experimentation

Nearest neighbor search for data compression

Computational evaluation of hot queues

Analysis of approximate nearest neighbor searching with clustered point sets

Approximate nearest neighbor search using the extended general space-filling curves heuristic

A practical perfect hashing algorithm

A theoretician’s guide to the experimental analysis of algorithms

Towards a discipline of experimental algorithmics

Locally lifting the curse of dimensionality for nearest neighbor search

Experimental evaluation of disk-based data structures for nearest neighbor searching

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications