<--- Back to Details
First PageDocument Content
Combinatorics / Graphical models / Submodular set function / Flow network / Belief propagation / Bayesian network / Graph theory / Network flow / Mathematics
Date: 2011-09-28 10:12:24
Combinatorics
Graphical models
Submodular set function
Flow network
Belief propagation
Bayesian network
Graph theory
Network flow
Mathematics

A Data-based approach to Social Influence Maximization

Add to Reading List

Source URL: www.vldb.org

Download Document from Source Website

File Size: 805,35 KB

Share Document on Facebook

Similar Documents

Auction theory / Mathematics / Submodular set function / Competitive equilibrium / Theoretical computer science / Valuation / Gross substitutes / Software engineering / Pure / Combinatory logic

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

Mathematics / Matroid theory / Combinatorics / Discrete mathematics / Matroid / Jack Edmonds / Weighted matroid / Regular matroid / Dual matroid / Submodular set function / Graphic matroid / Book:Matroid Theory

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

DocID: 1r2Rn - View Document

Submodular set function / Flow network / Mathematics / Networks / Order theory

On the Submodularity of Influence in Social Network

DocID: 1qZB1 - View Document

Submodular set function / Automatic summarization / Computing

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

Mathematical optimization / Mathematics / Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational complexity theory / Submodular set function / Randomized rounding / Optimization problem / Matroid / Ellipsoid method

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

DocID: 1qR3A - View Document