Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1145/2578221 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985289891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for substring near neighbor problem / 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: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Locality Sensitive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417698 / 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: Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:13, 10 July 2024

scientific article
Language Label Description Also known as
English
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
scientific article

    Statements

    Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    Fourier analysis of Boolean functions
    0 references
    LSH
    0 references
    locality-sensitive hashing
    0 references
    noise sensitivity
    0 references
    noise stability
    0 references
    0 references