<--- Back to Details
First PageDocument Content
Submodular set function / Order theory / Matroid / FKG inequality / Supermodular function / Linear programming / Oriented matroid / Polymatroid / Mathematics / Mathematical optimization / Matroid theory
Date: 2012-03-20 11:31:10
Submodular set function
Order theory
Matroid
FKG inequality
Supermodular function
Linear programming
Oriented matroid
Polymatroid
Mathematics
Mathematical optimization
Matroid theory

Learning Submodular Functions Maria-Florina Balcan

Add to Reading List

Source URL: www.cc.gatech.edu

Download Document from Source Website

File Size: 214,90 KB

Share Document on Facebook

Similar Documents

GROSS SUBSTITUTABILITY : AN ALGORITHMIC SURVEY RENATO PAES LEME∗ Abstract. The concept of gross substitute valuations was introduced by Kelso and Crawford as a sufficient conditions for the existence of Walrasian equil

GROSS SUBSTITUTABILITY : AN ALGORITHMIC SURVEY RENATO PAES LEME∗ Abstract. The concept of gross substitute valuations was introduced by Kelso and Crawford as a sufficient conditions for the existence of Walrasian equil

DocID: 1rptM - View Document

143  Documenta Math. The Coming of the Matroids William H. Cunningham

143 Documenta Math. The Coming of the Matroids William H. Cunningham

DocID: 1r2Rn - View Document

On the Submodularity of Influence in Social Network

On the Submodularity of Influence in Social Network

DocID: 1qZB1 - View Document

TimeMachine: Timeline Generation for Knowledge-Base Entities Tim Althoff*, Xin Luna Dong† , Kevin Murphy† , Safa Alai† , Van Dang† , Wei Zhang† *Computer Science Department, Stanford University, Stanford, CA 94

TimeMachine: Timeline Generation for Knowledge-Base Entities Tim Althoff*, Xin Luna Dong† , Kevin Murphy† , Safa Alai† , Van Dang† , Wei Zhang† *Computer Science Department, Stanford University, Stanford, CA 94

DocID: 1qWsb - View Document

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

DocID: 1qR3A - View Document