✦ LIBER ✦

Refinements to nearest-neighbor searching ink-dimensional trees

✍ Scribed by Robert F. Sproull

Book ID: 105301329
Publisher: Springer
Year: 1991
Tongue: English
Weight: 599 KB
Volume: 6
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01759061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Randomized Partition Trees for Nearest N

Randomized Partition Trees for Nearest Neighbor Search

✍ Dasgupta, Sanjoy; Sinha, Kaushik 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 464 KB

Optimal bucket size for nearest neighbor

Optimal bucket size for nearest neighbor searching in k-d trees

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

Partially specified nearest neighbor sea

Partially specified nearest neighbor searches using k-d trees

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

Fast exact k nearest neighbors search us

Fast exact k nearest neighbors search using an orthogonal search tree

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

SR-tree: An index structure for nearest-

SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data

✍ Norio Katayama; Shin'ichi Satoh 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in