158 search results - page 19 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
86
Voted
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
SIGMOD
2003
ACM
15 years 9 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...
108
click to vote
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...