Submodularity in Machine Learning Andreas Krause Stefanie Jegelka.
Learning Submodular Functions TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A AA A AAA Maria Florina Balcan LGO,
Abductive Reasoning
A Toolbox for Online Algorithms Marcin Bieńkowski U niversity of Wroc ław phd open 2011
CS 312: Algorithm Analysis Lecture #38: Approximation Algorithms and Local Search Credit: Tony Martinez, Eric Ringger, and some figures from Dasgupta et.
Inapproximability of the Smallest Superpolyomino Problem Andrew Winslow Tufts University.
Abductive Reasoning CS621 – Artificial Intelligence Aarif Jindani(113050050) Alex Poovathingal(113050035) Ashok Rawat(113050018) Department of CSE IIT,
April 14, 2009, Arizona State University Committee: Andrea W. Richa (Chair) Goran Konjevod Rida Bazzi Christian Scheideler Overlay Network Construction.
Bounded Approximation Algorithms Sometimes we can handle NP problems with polynomial time algorithms which are guaranteed to return a solution within some.
CS 312: Algorithm Analysis
Inapproximability of the Smallest Superpolyomino Problem
Adaptive Submodularity : A New Approach to Active Learning and Stochastic Optimization
