66 search results - page 8 / 14 » Scalable similarity search with optimized kernel hashing |
104
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
BIBE
2005
IEEE
15 years 3 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 ...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
160
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...