138 search results - page 23 / 28 » K-Nearest Neighbor Search for Moving Query Point |
SISAP
2009
IEEE
14 years 2 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
PAMI
2011
13 years 2 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...