Learning Probabilistic Models for Graph Partitioning in the Presence of Noise

Published on ● Video Link: https://www.youtube.com/watch?v=R4yjnnxesQM



Duration: 46:41
668 views
9


Aravindan Vijayaraghavan, Northwestern University
https://simons.berkeley.edu/talks/aravindan-vijayaraghavan-2016-11-14
Learning, Algorithm Design and Beyond Worst-Case Analysis







Tags:
Aravindan Vijayaraghavan
Learning Algorithm Design and Beyond Worst-Case Analysis
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley