Sciweavers

2260 search results - page 317 / 452
» A new algorithm for clustering search results
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Gesture Recognition by Learning Local Motion Signatures
This paper overviews a new gesture recognition framework based on learning local motion signatures (LMSs) introduced by [1]. After the generation of these LMSs computed on one i...
Mohamed-Becha Kaaniche, Francois Bremond
TIP
1998
129views more  TIP 1998»
15 years 6 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
16 years 26 days ago
Using H.264 coded block patterns for fast inter-mode selection
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
Bo-Yuan Chen, Shih-Hsuan Yang
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 11 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay