Nearly optimal sparse fourier transform

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Haitham Hassanieh MIT, Cambridge, MA, USA
Piotr Indyk MIT, Cambridge, MA, USA
Dina Katabi MIT, Cambridge, MA, USA
Eric Price MIT, Cambridge, MA, USA
Nearly optimal sparse fourier transform Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 24
· Downloads (12 Months): 268
· Downloads (cumulative): 268
· Citation Count: 3

Published in:
Cover Image
 
· Proceeding
STOC '12 Proceedings of the 44th symposium on Theory of Computing
Pages 563-578
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1245-5 doi>10.1145/2213977.2214029

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 © 2013 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