27 search results - page 3 / 6 » Local Search in Smooth Convex Sets |
CVPR
2009
IEEE
15 years 27 days ago
2009
IEEE
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
GECCO
2007
Springer
13 years 12 months ago
2007
Springer
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
CEC
2008
IEEE
14 years 7 days ago
2008
IEEE
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
SIBGRAPI
2008
IEEE
14 years 4 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...