151 search results - page 23 / 31 » Expected-case complexity of approximate nearest neighbor sea... |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
SIGMOD
2002
ACM
14 years 7 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...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...