2816 search results - page 5 / 564 » Submodular function minimization |
CORR
2010
Springer
13 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
13 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
13 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...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
STOC
2012
ACM
12 years 7 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...