✦ LIBER ✦

Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space

✍ Scribed by Cleary, John Gerald

Book ID: 121421146
Publisher: Association for Computing Machinery
Year: 1979
Tongue: English
Weight: 533 KB
Volume: 5
Category: Article
ISSN: 0098-3500
DOI: 10.1145/355826.355832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of an adaptive algorithm to fin

Analysis of an adaptive algorithm to find the two nearest neighbors

✍ P. V. Poblete 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 411 KB

The efficiency of using k-d trees for fi

The efficiency of using k-d trees for finding nearest neighbors in discrete space

✍ O.J. Murphy; S.M. Selkow 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Analysis of nearest neighbor load balanc

Analysis of nearest neighbor load balancing algorithms for random loads

✍ Peter Sanders 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Nearest neighbor load balancing algorithms, like diusion, are popular due to their simplicity, ¯exibility, and robustness. We show that they are also asymptotically very ecient when a random rather than a worst case initial load distribution is considered. We show that diusion needs Hlog n 2ad balan

Probabilistic analysis of an algorithm f

Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection

✍ Frank Bartling; Klaus Hinrichs 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 528 KB

Combinatorial and spectral aspects of ne

Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

✍ Yingchao Zhao; Shang-hua Teng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 804 KB

An algorithm for finding nearest neighbo

An algorithm for finding nearest neighbours in (approximately) constant average time

✍ Enrique Vidal Ruiz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 792 KB