Sciweavers

2816 search results - page 8 / 564
» Submodular function minimization
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 10 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
ICCV
2009
IEEE
15 years 1 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
ICCV
2011
IEEE
12 years 9 months ago
Generalized Roof Duality for Pseudo-Boolean Optimization
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
Fredrik Kahl, Petter Strandmark
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 10 months ago
A note on concentration of submodular functions
We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding f...
Jan Vondrák
WINE
2005
Springer
182views Economy» more  WINE 2005»
14 years 3 months ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...