Combinatorial Algorithms for Compressed Sensing
From MaRDI portal
Recommendations
- Compressed sensing and best \(k\)-term approximation
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Compressed sensing
- Compressed Sensing and Redundant Dictionaries
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Cited in
(41)- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A hierarchical framework for recovery in compressive sensing
- Row products of random matrices
- Strengthening hash families and compressive sensing
- An algebraic perspective on integer sparse recovery
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Generalized framework for group testing: queries, feedbacks and adversaries
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Compressive sensing and algebraic coding: connections and challenges
- Nesterov's algorithm solving dual formulation for compressed sensing
- Sequential adaptive compressed sampling via Huffman codes
- Fewer Bernoulli measurements satisfying the constraint of reconstruction probability
- On the design of deterministic matrices for fast recovery of Fourier compressible functions
- Efficiently decodable compressed sensing by list-recoverable codes and recursion
- Phase transitions in q-states signal reconstruction
- Sparse recovery with partial support knowledge
- On low rank matrix approximations with applications to synthesis problem in compressed sensing
- Improved algorithms for adaptive compressed sensing
- Sparse Recovery
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Inferring Sparse Preference Lists from Partial Information
- Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk
- Nearly linear-time model-based compressive sensing
- scientific article; zbMATH DE number 6312913 (Why is no real title available?)
- Compressive sensing using locality-preserving matrices
- Stronger _2/_2 compressed sensing; without iterating
- Approximation-tolerant model-based compressive sensing
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- Sublinear time, measurement-optimal, sparse recovery for all
- Subquadratic non-adaptive threshold group testing
- Algebraic compressed sensing
- Simple Codes and Sparse Recovery with Fast Decoding
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- Streaming algorithms for geometric Steiner forest
- Fast one-pass sparse approximation of the top eigenvectors of huge approximately low-rank matrices? Yes, MAM^!
- Combinatorial sublinear-time Fourier algorithms
- Deterministic \(k\)-set structure
- A note on compressed sensing and the complexity of matrix multiplication
This page was built for publication: Combinatorial Algorithms for Compressed Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613658)
