92 search results - page 15 / 19 » Quality and efficiency in high dimensional nearest neighbor ... |
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
85
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...
101
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...
177
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
106
click to vote
BIBE
2003
IEEE
15 years 2 months ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...