Probabilistic Hashing Methods for Succinct Data Representations and Applications

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=ksa2O7FQ_SY


Duration: 39:22
265 views
1

Ping Li, Rutgers University
Succinct Data Representations and Applications
http://simons.berkeley.edu/talks/ping-li-2013-09-19



Other Videos By Simons Institute for the Theory of Computing


2013-09-27Min-Wise Hashing for Large-Scale Regression and Classification
2013-09-27Noisy Estimation of Simultaneously Structured Models
2013-09-27Memory Limited, Streaming PCA
2013-09-27Computational and Statistical Tradeoffs via Convex Relaxation
2013-09-27Convex Relaxations for Permutation Problems
2013-09-27How (and Why) to "Read" Big Graphs
2013-09-27Going Off the Grid
2013-09-27Structured Sparsity-Inducing Norms Through Submodular Functions
2013-09-27Two Concise Representations for High-Dimensional Visual Data
2013-09-27Optimal Detection of Sparse Signal Segments
2013-09-27Probabilistic Hashing Methods for Succinct Data Representations and Applications
2013-09-27Dimensionality Reduction Via Sparse Matrices
2013-09-27Succinct Representations and Efficient Algorithms Based on Linear Programming
2013-09-27Inferring Structural Properties: Graphs and Bridges
2013-09-27Fast Testing of Graph Properties
2013-09-27Spectral Sparsification of Graphs
2013-09-27Sampling for Subset Selection and Applications
2013-09-27Nimble Algorithms for Cloud Computing
2013-09-27How Robust are Linear Sketches to Adaptive Inputs?
2013-09-27Power to the Points: Local Certificates for Clusterings
2013-09-27Homomorphic Sketches: Shrinking Big Data without Sacrificing Structure


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
Ping Li