Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-008-9110-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124659530 / 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: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson-Lindenstrauss lemma and the sphericity of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variants of the Johnson–Lindenstrauss lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic theory of learning: Robust concepts and random projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821981 / 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: Lower bounds for linear degeneracy testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast randomized algorithm for the approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster least squares approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4112938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection constants of symmetric spaces and variants of Khintchine's inequality / rank
 
Normal rank

Latest revision as of 06:37, 2 July 2024

scientific article
Language Label Description Also known as
English
Fast dimension reduction using Rademacher series on dual BCH codes
scientific article

    Statements

    Fast dimension reduction using Rademacher series on dual BCH codes (English)
    0 references
    0 references
    0 references
    14 December 2009
    0 references
    fast dimension reduction
    0 references
    measure concentration
    0 references
    probability in Banach spaces
    0 references
    error correcting codes
    0 references

    Identifiers