Approximate closest-point queries in high dimensions (Q1209329): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1105494
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marshall W. Bern / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Expected-Time Algorithms for Closest Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Searching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90222-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998512964 / rank
 
Normal rank

Latest revision as of 11:20, 30 July 2024

scientific article
Language Label Description Also known as
English
Approximate closest-point queries in high dimensions
scientific article

    Statements

    Approximate closest-point queries in high dimensions (English)
    0 references
    16 May 1993
    0 references
    0 references
    computational geometry
    0 references
    pattern matching
    0 references
    quadtrees
    0 references
    closest-point queries
    0 references
    data structures
    0 references
    0 references
    0 references