Sciweavers

4860 search results - page 487 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ICIP
2010
IEEE
15 years 2 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
DAM
2011
14 years 11 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
ICIP
2002
IEEE
16 years 5 months ago
A kernel machine based approach for multi-view face recognition
Techniques that can introduce low-dimensional feature representation with enhanced discriminatory power is of paramount importance in face recognition applications. It is well kno...
Juwei Lu, Kostas N. Plataniotis, Anastasios N. Ven...
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
15 years 9 months ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui
WSC
2008
15 years 6 months ago
Simulation optimization for industrial scheduling using hybrid genetic representation
Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operati...
Marcus Andersson, Amos Ng, Henrik Grimm