An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu:
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
J. ACM 45(6): 891-923(1998)@article{DBLP:journals/jacm/AryaMNSW98,
author = {Sunil Arya and
David M. Mount and
Nathan S. Netanyahu and
Ruth Silverman and
Angela Y. Wu},
title = {An Optimal Algorithm for Approximate Nearest Neighbor Searching
Fixed Dimensions},
journal = {J. ACM},
volume = {45},
number = {6},
year = {1998},
pages = {891-923},
ee = {db/journals/jacm/AryaMNSW98.html, http://doi.acm.org/10.1145/293347.293348},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
CDROM Version: Load the CDROM "Volume 5 Issue 2, JACM, VLDB-J, POS, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- Roger Weber, Klemens Böhm:
Trading Quality for Time with Nearest Neighbor Search.
EDBT 2000: 21-35
- Gísli R. Hjaltason, Hanan Samet:
Distance Browsing in Spatial Databases.
ACM Trans. Database Syst. 24(2): 265-318(1999)
- Pavel Zezula, Pasquale Savino, Giuseppe Amato, Fausto Rabitti:
Approximate Similarity Retrieval with M-Trees.
VLDB J. 7(4): 275-293(1998)
BibTeX
Copyright © Sun May 17 00:05:54 2009
by Michael Ley (ley@uni-trier.de)