92 search results - page 13 / 19 » Similarity Search in High Dimensions via Hashing |
197
click to vote
TKDE
2011
15 years 29 days ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
184
click to vote
BIBE
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
140
click to vote
IJCNN
2006
IEEE
16 years 2 days ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
154
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
155
click to vote
TPDS
2008
15 years 6 months ago
2008
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...