ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

A fast and efficient algorithm for low-rank approximation of a matrix

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Nam H. Nguyen Johns Hopkins University, Baltimore, MD, USA
Thong T. Do Johns Hopkins University, Baltimore, MD, USA
Trac D. Tran Johns Hopkins University, Baltimore, MD, USA
Published in:
Cover Image
 
· Proceeding
STOC '09 Proceedings of the 41st annual ACM symposium on Theory of computing
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-506-2 doi>10.1145/1536414.1536446
A fast and efficient algorithm for low-rank approximation of a matrix Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 72
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder