✦ LIBER ✦

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

✍ Scribed by Kushilevitz, Eyal; Ostrovsky, Rafail; Rabani, Yuval

Book ID: 118178254
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 232 KB
Volume: 30
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539798347177

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient nearest neighbor search in

An efficient nearest neighbor search in high-dimensional data spaces

✍ Dong-Ho Lee; Hyoung-Joo Kim 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 240 KB

the result that basically none of the querying and indexing techniques which provide good results on lowdimensional data also performs sufficiently well on high-dimensional data. Many researchers have called this problem the "curse of dimensionality" [3], and many database-related projects have trie

Audio Fingerprinting: Nearest Neighbor S

Audio Fingerprinting: Nearest Neighbor Search in High Dimensional Binary Spaces

✍ Miller, Matthew L. ;Rodriguez, Manuel Acevedo ;Cox, Ingemar J. 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 430 KB

Tree structures for high dimensionality

Tree structures for high dimensionality nearest neighbor searching

✍ C.M. Eastman; S.F. Weiss 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 887 KB

Composite Distance Transformation for In

Composite Distance Transformation for Indexing andk-Nearest-Neighbor Searching in High-Dimensional Spaces

✍ Yi Zhuang; Yue-Ting Zhuang; Fei Wu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 611 KB

A Fast Approximate Nearest Neighbor Sear

A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space

✍ Esmaeili, Mani Malek; Ward, R. K.; Fatourechi, M. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 765 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