✦ LIBER ✦

Deferred data structure for the nearest neighbor problem

✍ Scribed by Alok Aggarwal; Prabhakar Raghavan

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 424 KB
Volume: 40
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90164-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The nearest neighbor problem in an abstr

The nearest neighbor problem in an abstract metric space

✍ Charles D Feustel; Linda G Shapiro 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 246 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

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

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

Efficient algorithms for computing two n

Efficient algorithms for computing two nearest-neighbor problems on a rap

✍ Tzong-Wann Kao; Shi-Jinn Horng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 782 KB

Green functions for nearest- and next-ne

Green functions for nearest- and next-nearest-neighbor hopping on the Bethe lattice

✍ M. Kollar; M. Eckstein; K. Byczuk; N. Blümer; P. van Dongen; M.H. Radke de Cuba; 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB