158 search results - page 6 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
100
click to vote
VLDB
2000
ACM
15 years 29 days ago
2000
ACM
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
MICAI
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
111
click to vote
KDD
2008
ACM
15 years 9 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
SODA
2000
ACM
14 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...