843 search results - page 49 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
136
click to vote
LION
2009
Springer
15 years 8 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
125
click to vote
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
123
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
126
click to vote
WINE
2007
Springer
15 years 7 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...