Carnegie Mellon Beyond Convexity – Submodularity in Machine Learning Andreas Krause, Carlos Guestrin Carnegie Mellon University International Conference.
Graph Orientations and Submodular Flows Lecture 6: Jan 26.
1 Submodular Functions in Combintorial Optimization Lecture 6: Jan 26 Lecture 8: Feb 1.
Stability of Influence Maximization Xinran He and David Kempe University of Southern California {xinranhe, dkempe}@usc.edu 08/26/2014.
Manuel Gomez Rodriguez Bernhard Schölkopf I NFLUENCE M AXIMIZATION IN C ONTINUOUS T IME D IFFUSION N ETWORKS 29.06.12, ICML ‘12.
Event Detection In Activity Networks. Introduction involve monitoring routinely collected data Want to detect “events of interest” events typically.
Influence Maximization in Continuous Time Diffusion Networks
Maximizing the Spread of Influence through a Social Network
1 Spanning Tree Polytope x1 x2 x3 Lecture 11: Feb 21.
Strategyproof Mechanisms for Competitive Influence in Social Networks ()
