Playlist: 21 videos

Sublinear Algorithms and Nearest-Neighbor Search

0:41:59

Adaptive Sparse Recovery with Limited Adaptivity

Eric Price (University of Texas at Austin)
https://simons.berkeley.edu/talks/adaptive-sparse-recovery-limited-adaptivity
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:38:42

Universal Sketches

Vladimir Braverman (Johns Hopkins University)
https://simons.berkeley.edu/talks/universal-sketches
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:44:30

Testing and Learning Distributions Under Local Information Constraints

Clement Canonne (Stanford University)
https://simons.berkeley.edu/talks/testing-and-learning-distributions-under-local-information-constraints
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:43:56

Erasures vs. Errors in Local Decoding and Property Testing

Sofya Raskhodnikova (Boston University)
https://simons.berkeley.edu/talks/erasures-vs-errors-local-decoding-and-property-testing
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:41:1

Sublinear Time Local-Access Random Generators

Ronitt Rubinfeld (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/sublinear-time-local-access-random-generators
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
1:2:16

Importance Sampling in High Dimensions via Hashing

Moses Charikar (Stanford University)
https://simons.berkeley.edu/talks/importance-sampling-high-dimensions-hashing
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:57:44

Labeling a Data Set Using Sublinearly Many Queries

Sanjoy Dasgupta (UC San Diego)
https://simons.berkeley.edu/talks/labeling-data-set-using-sublinearly-many-queries
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:44:55

An Optimal Space Lower Bound for Approximating MAX-CUT

Michael Kapralov (Ecole Polytechnique Federale de Lausanne)
https://simons.berkeley.edu/talks/approximating-cost-metric-k-nearest-neighbor-graph-sublinear-time
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:42:1

Sublinear Algorithms for (Delta + 1) Vertex Coloring

Sepehr Assadi (University of Pennsylvania)
https://simons.berkeley.edu/talks/sublinear-algorithms-delta-1-vertex-coloring
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:40:21

Monte Carlo Approximation Certificates for K-Means Clustering

Dustin Mixon (Ohio State University)
https://simons.berkeley.edu/talks/monte-carlo-approximation-certificates-k-means-clustering
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page