360 search results - page 27 / 72 » Indexing the Distance: An Efficient Method to KNN Processing |
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...
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...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper introduces a new method for shape registration by matching vector distance functions. The vector distance function representation is more flexible than the conventional...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...