Playlist: 21 videos

Sublinear Algorithms and Nearest-Neighbor Search

0:28:24

Certified Sub-Linear Lower Bounds for K-Means Clustering

Soledad Villar (New York University)
https://simons.berkeley.edu/talks/certified-sub-linear-lower-bounds-k-means-clustering
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:44:49

High Dimensional Robust Sparse Regression

Constantine Caramanis (University of Texas at Austin)
https://simons.berkeley.edu/talks/high-dimensional-robust-sparse-regression
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:44:25

Online Algorithms for Low Rank Approximation

Aditya Bhaskara (University of Utah)
https://simons.berkeley.edu/talks/online-algorithms-low-rank-approximation
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:40:6

Fast NN Prediction with No Statistical Tradeoff

Samory Kpotufe (Princeton University)
https://simons.berkeley.edu/talks/fast-nn-prediction-no-statistical-tradeoff
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:46:5

Spectral Partitioning for Metrics (And NNs Too)

Alex Andoni (Columbia University)
https://simons.berkeley.edu/talks/spectral-partitioning-metrics-and-nns-too
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:48:21

Holder Homeomorphisms and Approximate Nearest Neighbors

Ilya Razenshteyn (Microsoft Research)
https://simons.berkeley.edu/talks/tba-8
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:39:42

Efficient Reductions for k-Nearest Neighbor Search

Rasmus Pagh (IT University of Copenhagen)
https://simons.berkeley.edu/talks/efficient-reductions-k-nearest-neighbor-search
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:41:44

When Hashes Met Wedges - A Distributed Algorithm for Finding High Similarity Vectors

C. Seshadhri (UC Santa Cruz)
https://simons.berkeley.edu/talks/when-hashes-met-wedges-distributed-algorithm-finding-high-similarity-vectors
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:50:32

Efficient Structured Matrix Recovery and Nearly Linear Time Algorithms for Solving Inverse Symmetric M-Matrices

Aaron Sidford (Stanford University)
https://simons.berkeley.edu/talks/efficient-structured-matrix-recovery-and-nearly-linear-time-algorithms-solving-inverse
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page
0:40:43

Scalable Spatial Scan Statistics with Coresets

Jeff Phillips (University of Utah)
https://simons.berkeley.edu/talks/scalable-spatial-scan-statistics-coresets
Sublinear Algorithms and Nearest-Neighbor Search
Visit talk page