How Robust are Linear Sketches to Adaptive Inputs?

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


Duration: 43:55
171 views
3

David Woodruff, IBM Almaden
Succinct Data Representations and Applications
http://simons.berkeley.edu/talks/david-woodruff-2013-09-17



Other Videos By Simons Institute for the Theory of Computing


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
2013-09-27Simple and Deterministic Matrix Sketches
2013-09-27Randomized Numerical Linear Algebra
2013-09-27Something for Almost Nothing: Advances in Sub-Linear Time Algorithms
2013-09-27Input-sparsity Time Algorithms for Embeddings and Regression Problems
2013-09-24Introduction to Analysis on the Discrete Cube IV
2013-09-24Inapproximability of Constraint Satisfaction Problems V
2013-09-24Inapproximability of Constraint Satisfaction Problems IV
2013-09-24Introduction to Analysis on the Discrete Cube III


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
David Woodruff