Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5674437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear time algorithms for metric space problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple randomized sieve algorithm for the closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cure: An efficient clustering algorithm for large databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-filling curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for the on-line closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms / rank
 
Normal rank

Latest revision as of 11:09, 24 June 2024

scientific article
Language Label Description Also known as
English
Approximate \(k\)-closest-pairs in large high-dimensional data sets
scientific article

    Statements

    Approximate \(k\)-closest-pairs in large high-dimensional data sets (English)
    0 references
    0 references
    0 references
    8 February 2006
    0 references
    0 references
    Space Filling Curves
    0 references
    approximation algorithms
    0 references
    0 references