151 search results - page 22 / 31 » Expected-case complexity of approximate nearest neighbor sea... |
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
MMM
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
MM
2009
ACM
14 years 2 months ago
2009
ACM
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...