Search for Sparse Active Inputs: A Review
From MaRDI portal
Publication:4915261
DOI10.1007/978-3-642-36899-8_31zbMath1309.94018OpenAlexW46000818MaRDI QIDQ4915261
Publication date: 9 April 2013
Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_31
Related Items (3)
Signature codes for noisy multiple access adder channel ⋮ Almost separable matrices ⋮ On error correction with errors in both the channel and syndrome
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A remark on compressed sensing
- Sequential search for significant variables of an unknown function.
- Compression based homogeneity testing
- Compression-Based Methods of Statistical Analysis and Prediction of Time Series
- Learning out of leaders
- Universal coding, information, prediction, and estimation
- The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)
- Atomic Decomposition by Basis Pursuit
- Maximization of ESI. Jaynes principle in testing significant inputs of linear model
- On classification with empirically observed statistics and universal data compression
- Compressed Genotyping
- Boolean Compressed Sensing and Noisy Group Testing
- A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Information Theory and Statistics: A Tutorial
- Log-efficient search for significant inputs of linear model
This page was built for publication: Search for Sparse Active Inputs: A Review