A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.12.039 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Data-Dependent Hashing for Approximate Near Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stabbing number of a random Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay Triangulations in O(sort(n)) Time and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Efficient Distribution-Sensitive Point Location in Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality-sensitive hashing scheme based on p-stable distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walking in a triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distances in Uniformly Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum reachability preserved graph cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of resilience for nested aggregation query / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for the Minimum Enclosing Ball Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.12.039 / rank
 
Normal rank

Latest revision as of 13:20, 17 December 2024

scientific article; zbMATH DE number 7300880
Language Label Description Also known as
English
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
scientific article; zbMATH DE number 7300880

    Statements

    A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (English)
    0 references
    0 references
    0 references
    25 January 2021
    0 references
    computational geometry
    0 references
    approximate k-nearest-neighbors
    0 references

    Identifiers