Sciweavers

121 search results - page 1 / 25
» Adapting indexing trees to data distribution in feature spac...
Sort
View
CVIU
2010
93views more  CVIU 2010»
13 years 5 months ago
Adapting indexing trees to data distribution in feature spaces
Xiaoning Qian, Hemant D. Tagare
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
13 years 10 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
DBISP2P
2004
Springer
150views Database» more  DBISP2P 2004»
13 years 11 months ago
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these ...
Yanfeng Shu, Kian-Lee Tan, Aoying Zhou
DEXA
2010
Springer
187views Database» more  DEXA 2010»
13 years 3 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 7 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...