Algorithms and lower bounds for sparse recovery
Name
714249160-MIT.pdf
Description
Full printable version
Size
3.12 MB
Format
Adobe PDF
Checksum (MD5)
82121476c9b693b89d6f5a66c7bacd71
Author(s)
Price, Eric (Eric C.)
Advisor(s)
Piotr Indyk.
Date Issued
2010
Publisher
Massachusetts Institute of Technology
Abstract
We consider the following k-sparse recovery problem: design a distribution of m x n matrix A, such that for any signal x, given Ax with high probability we can efficiently recover x satisfying IIx - x l,
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 69-71).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
