✦ LIBER ✦

Tree structures for high dimensionality nearest neighbor searching

✍ Scribed by C.M. Eastman; S.F. Weiss

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 887 KB
Volume: 7
Category: Article
ISSN: 0959-2954
DOI: 10.1016/0306-4379(82)90023-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Strategies for efficient incremental nea

Strategies for efficient incremental nearest neighbor search

✍ Alan J Broder 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Probably correct k-nearest neighbor sear

Probably correct k-nearest neighbor search in high dimensions

✍ Jun Toyama; Mineichi Kudo; Hideyuki Imai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 850 KB

Critical indices for the two-dimensional

Critical indices for the two-dimensional Ising model with nearest-neighbor and next-nearest-neighbor interactions

✍ Kazuyuki Tanaka; Tsuyoshi Horiguchi; Tohru Morita 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Deferred data structure for the nearest

Deferred data structure for the nearest neighbor problem

✍ Alok Aggarwal; Prabhakar Raghavan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Properties of the nearest neighbor inter

Properties of the nearest neighbor interchange metric for trees of small size

✍ William H.E. Day 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 653 KB