Algorithms for simultaneous sparse approximation. I: Greedy pursuit (Q1027254): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56698224, #quickstatements; #temporary_batch_1711439739529 |
Created claim: DBLP publication ID (P1635): journals/sigpro/TroppGS06, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/sigpro/TroppGS06 / rank | |||
Normal rank | |||
Latest revision as of 04:43, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for simultaneous sparse approximation. I: Greedy pursuit |
scientific article |
Statements
Algorithms for simultaneous sparse approximation. I: Greedy pursuit (English)
0 references
1 July 2009
0 references
greedy algorithms
0 references
orthogonal matching pursuit
0 references
multiple measurement vectors
0 references
simultaneous sparse approximation
0 references
subset selection
0 references
