251 search results - page 24 / 51 » When Is Nearest Neighbors Indexable |
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
DEXA
2010
Springer
13 years 5 months ago
2010
Springer
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...
JGTOOLS
2008
13 years 7 months ago
2008
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
ISM
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...