Strengthening hash families and compressive sensing (Q1932362): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
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.1016/j.jda.2012.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083171863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of exponential sized families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the size of separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On greedy algorithms in coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Perfect Hash Families Using a Greedy Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3195092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Conditional Expectation Algorithms for Constructing Hash Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3000893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving two recursive constructions for covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Algorithms for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus nonadaptive attribute-efficient learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lovász local lemma and its applications to some combinatorial arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic constructions of compressed sensing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized uncertainty principle and sparse representation in pairs of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sparse Representations in Arbitrary Redundant Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery of Exact Sparse Representations in the Presence of Bounded Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial 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: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of combinatorial testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization / rank
 
Normal rank

Latest revision as of 03:17, 6 July 2024

scientific article
Language Label Description Also known as
English
Strengthening hash families and compressive sensing
scientific article

    Statements

    Strengthening hash families and compressive sensing (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    compressive sensing
    0 references
    hash family
    0 references
    column replacement
    0 references
    Stein-Lovász-Johnson theorem
    0 references
    Lovász local lemma
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references