Sciweavers

39 search results - page 5 / 8
» Choosing Between Two Learning Algorithms Based on Calibrated...
Sort
View
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 1 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
IJCAI
2007
13 years 8 months ago
Fast Image Alignment Using Anytime Algorithms
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
Rupert Brooks, Tal Arbel, Doina Precup
ECCV
2000
Springer
14 years 9 months ago
Colour by Correlation in a Three-Dimensional Colour Space
We improve the promising Colour by Correlation method for computational colour constancy by modifying it to work in a three dimensional colour space. The previous version of the al...
Kobus Barnard, Lindsay Martin, Brian V. Funt
ICRA
2006
IEEE
165views Robotics» more  ICRA 2006»
14 years 1 months ago
Biped Gait Optimization using Spline Function based Probability Model
— A new Estimation of Distribution Algorithm (EDA) with spline kernel function (EDA_S) is proposed to optimize biped gait for a nine-link humanoid robot. Gait synthesis of the bi...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
ICML
2006
IEEE
14 years 8 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan