Efficient Reductions for k-Nearest Neighbor Search
360 views · Published 30 November 2018 · 39:42 · Indexed 21 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Rasmus Pagh (IT University of Copenhagen) https://simons.berkeley.edu/talks/efficient-reductions-k-nearest-neighbor-search Sublinear Algorithms and Nearest-Neighbor Search
More from this channel
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
37:51
On Maximizing Revenue for Multi-Item Auctions
-
32:46
How Well Do Prices Coordinate Markets
-
35:22
Computational Efficiency Requires Simple Taxation