On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding repeated elements / 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: Finding frequent items in data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in extremal combinatorics. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two are better than one: fundamental parameters of frame coherence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbed Identity Matrices Have High Rank: Proof and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3665801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dimension reduction using Rademacher series on dual BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4883476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the restricted isometry property for random matrices / 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: On sparse reconstruction from Fourier and Gaussian measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank

Latest revision as of 09:39, 7 July 2024

scientific article
Language Label Description Also known as
English
On deterministic sketching and streaming for sparse recovery and norm estimation
scientific article

    Statements

    On deterministic sketching and streaming for sparse recovery and norm estimation (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2014
    0 references
    streaming algorithms
    0 references
    sparse recovery
    0 references
    heavy hitters
    0 references
    norm estimation
    0 references
    data streams
    0 references
    inner product
    0 references
    Johnson-Lindenstrauss transform
    0 references
    randomized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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