Sciweavers

46 search results - page 1 / 10
» Maximizing Non-Monotone Submodular Functions
Sort
View
81
Voted
FOCS
2007
IEEE
15 years 3 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
85
Voted
ACL
2011
14 years 1 months ago
Word Alignment via Submodular Maximization over Matroids
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...
Hui Lin, Jeff Bilmes
NAACL
2010
14 years 7 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
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...
Hui Lin, Jeff Bilmes
116
Voted
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
12 years 12 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
JMLR
2010
187views more  JMLR 2010»
14 years 4 months ago
SFO: A Toolbox for Submodular Function Optimization
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...
Andreas Krause