✦ LIBER ✦

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

✍ Scribed by Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela Y.

Book ID: 121226676
Publisher: Association for Computing Machinery
Year: 1998
Tongue: English
Weight: 281 KB
Volume: 45
Category: Article
ISSN: 0004-5411
DOI: 10.1145/293347.293348

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for approximate nea

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

✍ Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela 📂 Article 📅 1998 🏛 Association for Computing Machinery 🌐 English ⚖ 281 KB

An Optimal Randomized Cell Probe Lower B

An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching

✍ Chakrabarti, Amit; Regev, Oded 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 319 KB

A simple algorithm for nearest neighbor

A simple algorithm for nearest neighbor search in high dimensions

✍ Nene, S.A.; Nayar, S.K. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 762 KB

An efficient k nearest neighbors searchi

An efficient k nearest neighbors searching algorithm for a query line

✍ Subhas C. Nandy; Sandip Das; Partha P. Goswami 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 289 KB

An efficient approximation-elimination a

An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation

✍ V Ramasubramanian; K.K Paliwal 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 977 KB

[IEEE 2006 47th Annual IEEE Symposium on

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

✍ Andoni, Alexandr; Indyk, Piotr 📂 Article 📅 2006 🏛 IEEE ⚖ 282 KB