GPU accelerated greedy algorithms for compressed sensing (Q744210): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12532-013-0056-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116953231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast <it>k</it>-selection algorithms for graphics processing units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection by distributive partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPU accelerated greedy algorithms for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Pursuit for Compressive Sensing Signal Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: For most large underdetermined systems of equations, the minimal 𝓁<sub>1</sub>‐norm near‐solution approximates the sparsest near‐solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix recipes for hard thresholding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank

Latest revision as of 03:29, 9 July 2024

scientific article
Language Label Description Also known as
English
GPU accelerated greedy algorithms for compressed sensing
scientific article

    Statements

    GPU accelerated greedy algorithms for compressed sensing (English)
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    compressed sensing
    0 references
    sparse approximation
    0 references
    greedy algorithms
    0 references
    graphics processing units
    0 references
    parallel computing
    0 references
    IHT
    0 references
    NIHT
    0 references
    HTP
    0 references
    cosamp
    0 references
    subspace pursuit
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references