Learning Probabilistic Models for Graph Partitioning in the Presence of Noise
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=R4yjnnxesQM
Aravindan Vijayaraghavan, Northwestern University
https://simons.berkeley.edu/talks/aravindan-vijayaraghavan-2016-11-14
Learning, Algorithm Design and Beyond Worst-Case Analysis
Other Videos By Simons Institute for the Theory of Computing
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