120 search results - page 20 / 24 » Complementary Hashing for Approximate Nearest Neighbor Searc... |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
We present a novel expert-model of Query-Driven Locally Adaptive (QDLA) Fisher faces for robust face recognition. For each query face, the proposed method first fits local Fisher ...
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...
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...
JMLR
2010
13 years 2 months ago
2010
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...