Subspace embeddings for the L 1 -norm with applications
From MaRDI portal
Publication:5419146
DOI10.1145/1993636.1993736zbMath1288.68276OpenAlexW1969281479MaRDI QIDQ5419146
David P. Woodruff, Christian Sohler
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993736
Combinatorial optimization (90C27) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (8)
Spectral estimation from simulations via sketching ⋮ The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations ⋮ Optimal subsampling for large‐sample quantile regression with massive data ⋮ Quantile regression for large-scale data via sparse exponential transform method ⋮ Structured Random Sketching for PDE Inverse Problems ⋮ Unnamed Item ⋮ The Fast Cauchy Transform and Faster Robust Linear Regression
This page was built for publication: Subspace embeddings for the L 1 -norm with applications