Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1145/2728167 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2263882035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the cut-norm via Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Learning in Presence of Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise-tolerant learning, the parity problem, and the statistical query model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity estimation techniques from rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Closest-Point Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular matrix multiplication revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality-sensitive hashing scheme based on p-stable distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Agnostic Learning of Parities, Monomials, and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Noise-Tolerant Learning of Sparse Parities and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient noise-tolerant learning from statistical queries / 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: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point location in arrangements of hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning functions of \(k\) relevant variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy based nearest neighbor search in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of multidimensional and metric data structures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite functions on spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 15:52, 11 July 2024

scientific article
Language Label Description Also known as
English
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
scientific article

    Statements

    Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (English)
    0 references
    0 references
    24 March 2016
    0 references
    correlations
    0 references
    approximate closest pair
    0 references
    asymmetric embeddings
    0 references
    learning juntas
    0 references
    locality sensitive hashing
    0 references
    metric embedding
    0 references
    nearest neighbor
    0 references
    parity with noise
    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