Efficient Reductions for k-Nearest Neighbor Search

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


Duration: 39:42
297 views
2

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



Other Videos By Simons Institute for the Theory of Computing


2018-12-04Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree
2018-12-04Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
2018-12-03Proof Complexity Lower Bounds from Graph Expansion and Combinatorial Games
2018-12-03Orbits of Monomials and Factorization into Products of Linear Forms
2018-12-03Invariant Theory for Computer Scientists
2018-12-03Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
2018-12-03The GCT Program: Recent Developments and Some Concrete Open Problems
2018-11-30Scalable Spatial Scan Statistics with Coresets
2018-11-30Nearly Linear Time Algorithms for Solving Inverse Symmetric M-Matrices
2018-11-30When Hashes Met Wedges - A Distributed Algorithm for Finding High Similarity Vectors
2018-11-29Efficient Reductions for k-Nearest Neighbor Search
2018-11-29Holder Homeomorphisms and Approximate Nearest Neighbors
2018-11-29Spectral Partitioning for Metrics (And NNs Too)
2018-11-29Fast NN Prediction with No Statistical Tradeoff
2018-11-29Online Algorithms for Low Rank Approximation
2018-11-29High Dimensional Robust Sparse Regression
2018-11-28Certified Sub-Linear Lower Bounds for K-Means Clustering
2018-11-28Monte Carlo Approximation Certificates for K-Means Clustering
2018-11-28Sublinear Algorithms for (Delta + 1) Vertex Coloring
2018-11-28An Optimal Space Lower Bound for Approximating MAX-CUT
2018-11-28Labeling a Data Set Using Sublinearly Many Queries


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Sublinear Algorithms and Nearest-Neighbor Search
Rasmus Pagh