Expected-Case Complexity of Approximate Nearest Neighbor Searching (Q4706232)

From MaRDI portal
Revision as of 09:31, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1931310
Language Label Description Also known as
English
Expected-Case Complexity of Approximate Nearest Neighbor Searching
scientific article; zbMATH DE number 1931310

    Statements

    Expected-Case Complexity of Approximate Nearest Neighbor Searching (English)
    0 references
    0 references
    0 references
    19 June 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    nearest neighbor searching
    0 references
    approximation
    0 references
    expected-case analysis
    0 references
    priority search
    0 references
    sliding-midpoint tree
    0 references
    0 references