✦ LIBER ✦

Strategies for efficient incremental nearest neighbor search

✍ Scribed by Alan J Broder

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 507 KB
Volume: 23
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(90)90057-r

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

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

An efficient design of a nearest neighbo

An efficient design of a nearest neighbor classifier for various-scale problems

✍ Heesung Lee; Sungjun Hong; Imran Fareed Nizami; Euntai Kim 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 615 KB

By appropriate editing of the reference set and judicious selection of features, we can obtain an optimal nearest neighbor (NN) classifier that maximizes the accuracy of classification and saves computational time and memory resources. In this paper, we propose a new method for simultaneous referenc

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

Tighter Lower Bounds for Nearest Neighbo

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model

✍ Omer Barkol; Yuval Rabani 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we

A tabu search strategy for an efficient

A tabu search strategy for an efficient solution of linear systems in electromagnetic problems

✍ M. Dionigi; R. Sorrentino; L. Tarricone; A. Esposito 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 2 views

A strategy is proposed to enhance the performance of some numerical methods used in the solution of electromagnetic problems. The strategy can be extended to any numerical method based on the partitioning of the spatial domain into elementary cells. Two different implementations of the strategy are