The black-box complexity of nearest-neighbor search (Q2581270): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Plongements lipschitziens dans ${\bbfR}\sp n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric Ramsey-type phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest neighbor queries in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on analysis on metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nearest neighbors in growth-restricted metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing the embedding / rank
 
Normal rank

Latest revision as of 14:48, 11 June 2024

scientific article
Language Label Description Also known as
English
The black-box complexity of nearest-neighbor search
scientific article

    Statements

    The black-box complexity of nearest-neighbor search (English)
    0 references
    0 references
    0 references
    9 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    nearest neighbor searching
    0 references
    similarity search
    0 references
    closest point queries
    0 references
    doubling metric spaces
    0 references
    0 references