research
∙
07/15/2023
Fully Scalable MPC Algorithms for Clustering in High Dimension
We design new algorithms for k-clustering in high-dimensional Euclidean ...
share
research
∙
06/05/2023
Near-Optimal Quantum Coreset Construction Algorithms for Clustering
k-Clustering in ℝ^d (e.g., k-median and k-means) is a fundamental machin...
research
∙
11/10/2022
Streaming Euclidean Max-Cut: Dimension vs Data Reduction
Max-Cut is a fundamental problem that has been studied extensively in va...
research
∙
07/10/2019
