1182 search results - page 170 / 237 » Iterative Methods in Combinatorial Optimization |
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
126
click to vote
CAIP
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...
117
click to vote
EMMCVPR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...