The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction
- Award ID(s):
- 2337993
- PAR ID:
- 10574823
- Publisher / Repository:
- Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
- Date Published:
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

