✦ LIBER ✦

MKL-tree: an index structure for high-dimensional vector spaces

✍ Scribed by Annalisa Franco; Alessandra Lumini; Dario Maio

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 611 KB
Volume: 12
Category: Article
ISSN: 0942-4962
DOI: 10.1007/s00530-006-0070-9

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

CVA file: an index structure for high-di

CVA file: an index structure for high-dimensional datasets

✍ Jiyuan An; Hanxiong Chen; Kazutaka Furuse; Nobuo Ohbo 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 527 KB

SPY-TEC: An efficient indexing method fo

SPY-TEC: An efficient indexing method for similarity search in high-dimensional data spaces

✍ Dong-Ho Lee; Hyoung-Joo Kim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 650 KB