52 search results - page 4 / 11 » Approximate nearest neighbors and the fast Johnson-Lindenstr... |
169
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
125
click to vote
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
SIAMSC
2008
14 years 9 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
105
Voted
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...