Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mark A. Iwen / rank
Normal rank
 
Property / author
 
Property / author: Mark A. Iwen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086190841 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1302.5936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / 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: Q4737200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved data stream summary: the count-min sketch and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Algorithms for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic constructions of compressed sensing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation guarantees for sublinear-time Fourier algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Robust Compressed Sensing Using Optimized Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4069280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1 + eps)-Approximate Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:59, 8 July 2024

scientific article
Language Label Description Also known as
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references