Sciweavers

12194 search results - page 190 / 2439
» Numberings Optimal for Learning
Sort
View
COMCOM
2008
127views more  COMCOM 2008»
15 years 6 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
AIEDAM
2011
15 years 1 months ago
Discovering implicit constraints in design
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
Madan Mohan Dabbeeru, Amitabha Mukerjee
ICPR
2000
IEEE
16 years 7 months ago
Growing Gaussian Mixture Models for Pose Invariant Face Recognition
A major challenge for face recognition algorithms lies in the variance faces undergo while changing pose. This problem is typically addressed by building view dependent models bas...
Ralph Gross, Jie Yang, Alex Waibel
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 10 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg
ALT
2004
Springer
16 years 3 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List