{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:49:06Z","timestamp":1774680546086,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250824","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"237-246","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":155,"title":["One sketch for all"],"prefix":"10.1145","author":[{"given":"A. C.","family":"Gilbert","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"M. J.","family":"Strauss","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"J. A.","family":"Tropp","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"R.","family":"Vershynin","sequence":"additional","affiliation":[{"name":"University of California-Davis, Davis, CA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/acha.1995.1026"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"e_1_3_2_1_3_1","volume-title":"Nov.","author":"Cand\u00e8s E.J.","year":"2004","unstructured":"E.J. Cand\u00e8s and T. Tao . Near optimal signal recovery from random projections: Universal encoding strategies? Submitted for publication , Nov. 2004 . E.J. Cand\u00e8s and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies? Submitted for publication, Nov. 2004."},{"key":"e_1_3_2_1_4_1","volume-title":"July","author":"Cohen A.","year":"2006","unstructured":"A. Cohen , W. Dahmen , and R. DeVore . Compressed Sensing and best k-term approximation. Submitted for publication , July 2006 . A. Cohen, W. Dahmen, and R. DeVore. Compressed Sensing and best k-term approximation. Submitted for publication, July 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720544"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. SPARS05","author":"Duarte M.F.","year":"2005","unstructured":"M.F. Duarte , M.B. Wakin , and R.G. Baraniuk . Fast reconstruction of piecewise smooth signals from random projections . In Proc. SPARS05 , Rennes, France , Nov. 2005 . M.F. Duarte, M.B. Wakin, and R.G. Baraniuk. Fast reconstruction of piecewise smooth signals from random projections. In Proc. SPARS05, Rennes, France, Nov. 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.615931"},{"key":"e_1_3_2_1_10_1","volume-title":"Algorithmic linear dimension reduction in the l1 norm for sparse vectors. Submitted for publication","author":"Gilbert A.C.","year":"2006","unstructured":"A.C. Gilbert , M.J. Strauss , J.A. Tropp , and R. Vershynin . Algorithmic linear dimension reduction in the l1 norm for sparse vectors. Submitted for publication , 2006 . A.C. Gilbert, M.J. Strauss, J.A. Tropp, and R. Vershynin. Algorithmic linear dimension reduction in the l1 norm for sparse vectors. Submitted for publication, 2006."},{"key":"e_1_3_2_1_11_1","volume-title":"Mathematics Dept.","author":"Janson S.","year":"1994","unstructured":"S. Janson . Large deviation inequalities for sums of indicator variables. Technical report , Mathematics Dept. , Uppsala Univ. , 1994 . S. Janson. Large deviation inequalities for sums of indicator variables. Technical report, Mathematics Dept., Uppsala Univ., 1994."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCAS.2006.321036"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCAS.2006.321048"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286463"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.659602"},{"key":"e_1_3_2_1_16_1","volume-title":"Revised","author":"Tropp J.A.","year":"2006","unstructured":"J.A. Tropp and A.C. Gilbert . Signal recovery from random measurements via Orthogonal Matching Pursuit. Submitted for publication, Apr. 2005 . Revised , Nov. 2006 , 2006. J.A. Tropp and A.C. Gilbert. Signal recovery from random measurements via Orthogonal Matching Pursuit. Submitted for publication, Apr. 2005. Revised, Nov. 2006, 2006."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1127084"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. Picture Coding Symposium 2006","author":"Wakin M.","year":"2006","unstructured":"M. Wakin , J. Laska , M. Duarte , D. Baron , S. Sarvotham , D. Takhar , K. Kelly , and R. Baraniuk . Compressive imaging for video representation and coding . In Proc. Picture Coding Symposium 2006 , Beijing, China , Apr. 2006 . M. Wakin, J. Laska, M. Duarte, D. Baron, S. Sarvotham, D. Takhar, K. Kelly, and R. Baraniuk. Compressive imaging for video representation and coding. In Proc. Picture Coding Symposium 2006, Beijing, China, Apr. 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1364\/AO.44.004306"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2006.870159"}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250824"}},"subtitle":["fast algorithms for compressed sensing"],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":20,"alternative-id":["10.1145\/1250790.1250824","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250824","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}