Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time |
scientific article |
Statements
Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (English)
0 references
16 July 2014
0 references
compressed sensing
0 references
sublinear-time algorithms
0 references
sparse matrices
0 references
recovery algorithm
0 references
0 references
0.8326376080513
0 references
0.7878791093826294
0 references
0.7874146699905396
0 references
0.7796515226364136
0 references
0.7782267332077026
0 references
