Clustering -- Does Theory Help?

Channel:

Subscribers:

68,700

Published on December 12, 2013 9:38:33 PM ● Video Link: https://www.youtube.com/watch?v=n3LQqUQb870

Duration: 48:56

1,004 views

Ravi Kannan, Microsoft Research India
Simons Institute Open Lectures
http://simons.berkeley.edu/events/openlectures2013-fall-4

Other Videos By Simons Institute for the Theory of Computing

2013-12-17	Active Statistical Query Learning with Connections to Privacy
2013-12-17	Learning and DP
2013-12-17	Differential Privacy and Stochastic Gradient Descent
2013-12-17	Dual Query Release: A Practical Algorithm for Private Analysis of High Dimensional Data
2013-12-17	Real-time Aggregate Monitoring with Differential Privacy
2013-12-17	DP-WHERE: Differentially Private Modeling of Human Mobility
2013-12-17	Tutorial on Differential Privacy
2013-12-17	Musings on False Discovery Rate
2013-12-17	Selective Inference and False Discovery Rate II
2013-12-17	Selective Inference and False Discovery Rate I
2013-12-12	Clustering -- Does Theory Help?
2013-12-12	Vertical Versus Horizontal Poincare Inequalities
2013-12-12	Discrete Tori and Bounds for Linear Codes
2013-12-12	Some Pseudorandom Phenomena in Finite Fields
2013-12-12	Partial Difference Equations Over Compact Abelian Groups
2013-12-12	Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
2013-12-12	Laplacian Eigenvalues, Metric Uniformization, and Incidence Geometry
2013-12-12	Incidence Geometry and Applications to Theoretical Computer Science
2013-12-12	Counting Sumsets and Applications
2013-12-12	The Structure of Low Rank Matrices
2013-12-12	Building Monotone Expanders

Tags:

Simons Institute

UC Berkeley

computer science

theory of computing

Ravi Kannan