The extendible cell method for closest point problems (Q1161290): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of range searches in quad trees / 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: Q5526518 / 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: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order preserving extendible hashing and bucket tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940826 / rank
 
Normal rank

Latest revision as of 15:00, 13 June 2024

scientific article
Language Label Description Also known as
English
The extendible cell method for closest point problems
scientific article

    Statements

    The extendible cell method for closest point problems (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    22, 27-41 (1982)
    0 references
    multidimensional search
    0 references
    order preserving extendible hashing
    0 references