Computing Sparse Representations in O(N log N) Time

View/ Open
Published Version
http://spars2013.epfl.ch/data/_uploaded/flash/Paper%2059.pdfMetadata
Show full item recordCitation
Lin, Tsung-Han and H. T. Kung. 2013. Computing Sparse Representations in O(N log N) Time. Abstract. Paper presented at Signal Processing with Adaptive Sparse Structured Representations (SPARS 2013), École Polytechnique Fédérale de Lausanne, Switzerland, July 8-11.Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAPCitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:12667563
Collections
- FAS Scholarly Articles [18145]
Contact administrator regarding this item (to report mistakes or request changes)