Nearly-optimal bounds for sparse recovery in generic norms, with applications to <i>k</i>-median sketching

Article Details
Title:	Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
Article URLs:	https://doi.org/10.1137/1.9781611974331.ch24 http://dl.acm.org/citation.cfm?id=2884459
Alternative Article URLs:
Authors:	Arturs Backurs	MIT, CSAIL
	Piotr Indyk	MIT, CSAIL
	Ilya P. Razenshteyn	MIT, CSAIL
	David P. Woodruff	IBM Almaden
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/soda/BackursIRW16
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2016