Sciweavers

45 search results - page 6 / 9
» Dynamic similarity search in multi-metric spaces
Sort
View
TSMC
2010
13 years 2 months 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
CSCLP
2006
Springer
13 years 11 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
ICASSP
2011
IEEE
12 years 11 months ago
Integrating frame-based and segment-based dynamic time warping for unsupervised spoken term detection with spoken queries
Rapidly increasing quantities of multimedia and spoken content today demand fast and accurate retrieval approaches for convenient browsing. The spoken documents with wide variety ...
Chun-an Chan, Lin-Shan Lee
CIKM
2008
Springer
13 years 9 months ago
Modeling LSH for performance tuning
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...
Wei Dong, Zhe Wang, William Josephson, Moses Chari...
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes