158 search results - page 8 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
ICDE
2007
IEEE
15 years 3 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
109
click to vote
EDBT
1998
ACM
15 years 1 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
109
click to vote
TASLP
2008
14 years 9 months ago
2008
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...