15 search results - page 1 / 3 » Efficient Minimization of Decomposable Submodular Functions |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
JMLR
2010
12 years 11 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
ICCV
2009
IEEE
14 years 8 months ago
2009
IEEE
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...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...