Fast and near-optimal matrix completion via randomized basis pursuit (Q2900327)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6059345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and near-optimal matrix completion via randomized basis pursuit |
scientific article; zbMATH DE number 6059345 |
Statements
21 July 2012
0 references
compressed sensing
0 references
matrix completion
0 references
algorithm
0 references
Fast and near-optimal matrix completion via randomized basis pursuit (English)
0 references
0.8428807854652405
0 references
0.8405018448829651
0 references
0.818182647228241
0 references
0.816157341003418
0 references
0.8032877445220947
0 references
