3643 search results - page 4 / 729 » Learning Submodular Functions |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
ACL
2011
14 years 1 months ago
2011
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
NAACL
2010
14 years 7 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
106
click to vote
CONSTRAINTS
2008
14 years 10 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...