92 search results - page 3 / 19 » Similarity Search in High Dimensions via Hashing |
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
ANCS
2005
ACM
13 years 11 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
INFOVIS
2003
IEEE
13 years 10 months ago
2003
IEEE
Large numbers of dimensions not only cause clutter in multidimensional visualizations, but also make it difficult for users to navigate the data space. Effective dimension manage...
CVPR
2010
IEEE
14 years 1 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...
PCM
2001
Springer
13 years 9 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...