{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:59:11Z","timestamp":1776283151739,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536446","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"215-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["A fast and efficient algorithm for low-rank approximation of a matrix"],"prefix":"10.1145","author":[{"given":"Nam H.","family":"Nguyen","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thong T.","family":"Do","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trac D.","family":"Tran","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"e_1_3_2_1_2_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1983","unstructured":"G. H. Golub and C. F. V. Loan , Matrix Computations , Johns Hopkins University Press , Baltimore , 1983 . G. H. Golub and C. F. V. Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, 1983."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_30"},{"key":"e_1_3_2_1_5_1","unstructured":"S. Har-Peled Low rank matrix approximation in linear time \"Manuscript.  S. Har-Peled Low rank matrix approximation in linear time \"Manuscript."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"e_1_3_2_1_7_1","first-page":"225","volume-title":"Matrix approximation and projective clustering via","author":"Deshpande A.","year":"2006","unstructured":"A. Deshpande , L. Rademacher , S. Vempala , and G. Wang , Matrix approximation and projective clustering via volume sampling,\" Theory of Computing, vol. 2 , pp. 225 -- 247 , 2006 . A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, Matrix approximation and projective clustering via volume sampling,\" Theory of Computing, vol. 2, pp. 225 -- 247, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"e_1_3_2_1_10_1","first-page":"3369","volume-title":"IEEE Int. Conf. of Acous., Speech and Signal Proc.","author":"Do T. T.","year":"2008","unstructured":"T. T. Do , T. D. Tran , and L. Gan , Fast compressive sampling with structurally random matrices,\" Proc . IEEE Int. Conf. of Acous., Speech and Signal Proc. , pp. 3369 -- 3372 , May 2008 . T. T. Do, T. D. Tran, and L. Gan, Fast compressive sampling with structurally random matrices,\" Proc. IEEE Int. Conf. of Acous., Speech and Signal Proc., pp. 3369--3372, May 2008."},{"key":"e_1_3_2_1_11_1","unstructured":"F. Woolfe E. Liberty V. Rokhlin and M. Tygert A fast randomized algorithm for the approximation of matrices \" UCLA University Technical report No. 1386.  F. Woolfe E. Liberty V. Rokhlin and M. Tygert A fast randomized algorithm for the approximation of matrices \" UCLA University Technical report No. 1386."},{"key":"e_1_3_2_1_12_1","author":"Drineas P.","year":"2008","unstructured":"P. Drineas , M. W. Mahoney , S. Muthukrishnan , and T. Sarlos , Faster least square approximation,\" under review, SIAM Journal on Computing , 2008 . P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlos, Faster least square approximation,\" under review, SIAM Journal on Computing, 2008.","journal-title":"Faster least square approximation,\" under review, SIAM Journal on Computing"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"Fast dimension reduction using rademacher series on dual BCH codes,\" Symposium on Discrete Algorithms (SODA)","author":"Ailon N.","year":"2008","unstructured":"N. Ailon and E. Liberty , Fast dimension reduction using rademacher series on dual BCH codes,\" Symposium on Discrete Algorithms (SODA) , pp. 1 -- 9 , 2008 . N. Ailon and E. Liberty, Fast dimension reduction using rademacher series on dual BCH codes,\" Symposium on Discrete Algorithms (SODA), pp. 1--9, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_40"},{"key":"e_1_3_2_1_15_1","volume-title":"Trace Ideals and Their Applications","author":"Simon B.","year":"2005","unstructured":"B. Simon , Trace Ideals and Their Applications , American Mathematical Society , 2005 . B. Simon, Trace Ideals and Their Applications, American Mathematical Society, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002220050108"},{"key":"e_1_3_2_1_17_1","volume-title":"The Concentration of Measure Phenomenon","author":"Ledoux M.","year":"2001","unstructured":"M. Ledoux , The Concentration of Measure Phenomenon , American Mathematical Society , 2001 . M. Ledoux, The Concentration of Measure Phenomenon, American Mathematical Society, 2001."},{"key":"e_1_3_2_1_18_1","volume-title":"Annalen","volume":"319","author":"Buchholz A.","year":"2001","unstructured":"A. Buchholz , Operator Khintchine inequality in non-commutative probability,\" Math . Annalen , vol. 319 , 2001 . A. Buchholz, Operator Khintchine inequality in non-commutative probability,\" Math. Annalen, vol. 319, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"e_1_3_2_1_20_1","volume-title":"Matrix Analysis","author":"Horn R. A.","year":"2005","unstructured":"R. A. Horn and C. R. Johnson , Matrix Analysis , Cambridge University Press , 2005 . R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 2005."}],"event":{"name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA","acronym":"STOC '09","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:50Z","timestamp":1750253930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":20,"alternative-id":["10.1145\/1536414.1536446","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536446","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}