A strong lower bound for approximate nearest neighbor searching (Q834886): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975663164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds for nearest neighbor search and related problems in the cell probe model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for high dimensional nearest neighbor search and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nearest neighbor queries revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Closest-Point Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest neighbor pattern classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Searching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for union-split-find related problems on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On data structures and asymmetric communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Should Tables Be Sorted? / rank
 
Normal rank

Latest revision as of 21:38, 1 July 2024

scientific article
Language Label Description Also known as
English
A strong lower bound for approximate nearest neighbor searching
scientific article

    Statements

    A strong lower bound for approximate nearest neighbor searching (English)
    0 references
    0 references
    27 August 2009
    0 references
    computational geometry
    0 references
    approximate nearest neighbor searching
    0 references
    lower bound
    0 references

    Identifiers