3643 search results - page 11 / 729 » Learning Submodular Functions |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
ORL
2010
14 years 8 months ago
2010
We present an iterative method for constructing additive envelopes of continuous functions on a compact set, with contact at a prespecified point. For elements of a class of subm...
100
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...