✦ LIBER ✦

Randomized Partition Trees for Nearest Neighbor Search

✍ Scribed by Dasgupta, Sanjoy; Sinha, Kaushik

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity analysis for partitioning nea

✍ Zakarauskas, P.; Ozard, J.M. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 694 KB

Tree structures for high dimensionality

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

Refinements to nearest-neighbor searchin

✍ Robert F. Sproull 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 599 KB

Partially specified nearest neighbor sea

✍ C.M. Eastman; M. Zemankova 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Fast exact k nearest neighbors search us

✍ Yi-Ching Liaw; Maw-Lin Leou; Chien-Min Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Optimal bucket size for nearest neighbor

✍ C.M. Eastman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 287 KB