Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
From MaRDI portal
Publication:2933656
DOI10.1145/2483699.2483706zbMath1301.68162OpenAlexW2132032691MaRDI QIDQ2933656
David P. Woodruff, T. S. Jayram
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2483699.2483706
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ Sparser Johnson-Lindenstrauss Transforms ⋮ Optimal (Euclidean) Metric Compression ⋮ RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. ⋮ Tracking the l_2 Norm with Constant Update Time ⋮ Continuous Monitoring of l_p Norms in Data Streams ⋮ Improved linear embeddings via Lagrange duality ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Streaming Complexity of SVMs ⋮ Dimensionality reduction with subgaussian matrices: a unified theory ⋮ Unnamed Item ⋮ Optimal Bounds for Johnson-Lindenstrauss Transformations ⋮ Perfect $L_p$ Sampling in a Data Stream
This page was built for publication: Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error