57 search results - page 11 / 12 » High-Dimensional Similarity Search Using Data-Sensitive Spac... |
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
TSMC
2010
14 years 4 months ago
2010
In recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with c...
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
ERCIMDL
2000
Springer
15 years 1 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
127
click to vote
SIGCOMM
2009
ACM
15 years 3 months ago
2009
ACM
So far, the search for Opportunistic Network (ON) applications has focused on urban/rural scenarios where the combined use of mobility and the store-carry-and-forward paradigm hel...