Sciweavers

57 search results - page 11 / 12
» High-Dimensional Similarity Search Using Data-Sensitive Spac...
Sort
View
CVPR
2012
IEEE
11 years 8 months ago
Spherical hashing
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...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
TSMC
2010
13 years 8 days ago
Particle Swarm Optimization With Composite Particles in Dynamic Environments
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...
Lili Liu, Shengxiang Yang, Dingwei Wang
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 6 months ago
Kernel k-means: spectral clustering and normalized cuts
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...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
13 years 9 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
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...
Vitorino Ramos, Fernando Muge
SIGCOMM
2009
ACM
14 years 2 days ago
Opportunistic forwarding in workplaces
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...
Sabrina Gaito, Elena Pagani, Gian Paolo Rossi