Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit (Q2900327): Difference between revisions
From MaRDI portal
Changed an Item |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit | |||
| Property / arXiv classification | |||
cs.IT | |||
| Property / arXiv classification: cs.IT / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.LG | |||
| Property / arXiv classification: cs.LG / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.IT | |||
| Property / arXiv classification: math.IT / rank | |||
Normal rank | |||
Latest revision as of 10:26, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit |
scientific article |
Statements
21 July 2012
0 references
compressed sensing
0 references
matrix completion
0 references
algorithm
0 references
cs.IT
0 references
cs.LG
0 references
math.IT
0 references
