Back to Results
First PageMeta Content
Primality tests / Probabilistic complexity theory / Disjunct matrix / Euclidean algorithm / Mathematics / Combinatorics / Matrix theory


Lower Bounds for Sparse Recovery∗ Khanh Do Ba MIT CSAIL Piotr Indyk MIT CSAIL
Add to Reading List

Document Date: 2009-11-10 16:09:56


Open Document

File Size: 218,99 KB

Share Result on Facebook

City

Davenport / /

Company

IBM / Cambridge University Press / Cisco / /

Event

FDA Phase / /

IndustryTerm

sublinear-space algorithms / sparse recovery algorithm / deterministic recovery algorithm / correct protocols / public coin protocol / data stream computing / correct protocol / private coin protocol / recovery algorithm / deterministic algorithm / covery algorithms / estimation algorithm / imaging / recovery algorithms / /

Organization

Cambridge University / National Science Foundation / MIT / Center for Massive Data Algorithmics / Danish National Research Association / /

Person

Bob / Alice / David P. Woodruff / Eric Price / Piotr Indyk / Lucille Packard / /

Position

author / /

Product

Pentax K-x Digital Camera / Bpn (r) / Cowon D2+ Portable Audio Device / Bpn / D1 / /

Technology

specific recovery algorithm / correct protocols / 1 recovery algorithm / following algorithm / private coin protocol / C-approximate deterministic recovery algorithm / one-round protocols / specific recovery algorithms / recovery algorithms / sparse recovery algorithm / deterministic algorithm / J. Algorithms / public coin protocol / Capproximate deterministic recovery algorithm / sublinear-space algorithms / correct protocol / recovery algorithm / deterministic recovery algorithm / estimation algorithm / /

URL

http /

SocialTag