Certified Sub-Linear Lower Bounds for K-Means Clustering
681 views · Published 29 November 2018 · 28:24 · Indexed 16 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Soledad Villar (New York University) https://simons.berkeley.edu/talks/certified-sub-linear-lower-bounds-k-means-clustering 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