Matches in SemOpenAlex for { <https://semopenalex.org/work/W2007273639> ?p ?o ?g. }
- W2007273639 endingPage "54" @default.
- W2007273639 startingPage "1" @default.
- W2007273639 abstract "Nearest neighbor searching is the problem of preprocessing a set of n point points in d -dimensional space so that, given any query point q , it is possible to report the closest point to q rapidly. In approximate nearest neighbor searching, a parameter ε > 0 is given, and a multiplicative error of (1 + ε) is allowed. We assume that the dimension d is a constant and treat n and ε as asymptotic quantities. Numerous solutions have been proposed, ranging from low-space solutions having space O ( n ) and query time O (log n + 1/ε d −1 ) to high-space solutions having space roughly O (( n log n )/ε d ) and query time O (log ( n /ε)). We show that there is a single approach to this fundamental problem, which both improves upon existing results and spans the spectrum of space-time tradeoffs. Given a tradeoff parameter γ, where 2 ≤ γ ≤ 1/ε, we show that there exists a data structure of space O ( n γ d −1 log(1/ε)) that can answer queries in time O (log( n γ) + 1/(εγ) ( d −1)/2 . When γ = 2, this yields a data structure of space O ( n log (1/ε)) that can answer queries in time O (log n + 1/ε ( d −1)/2 ). When γ = 1/ε, it provides a data structure of space O (( n /ε d −1 )log(1/ε)) that can answer queries in time O (log( n /ε)). Our results are based on a data structure called a ( t ,ε)-AVD, which is a hierarchical quadtree-based subdivision of space into cells. Each cell stores up to t representative points of the set, such that for any query point q in the cell at least one of these points is an approximate nearest neighbor of q . We provide new algorithms for constructing AVDs and tools for analyzing their total space requirements. We also establish lower bounds on the space complexity of AVDs, and show that, up to a factor of O (log (1/ε)), our space bounds are asymptotically tight in the two extremes, γ = 2 and γ = 1/ε." @default.
- W2007273639 created "2016-06-24" @default.
- W2007273639 creator A5016442699 @default.
- W2007273639 creator A5022760571 @default.
- W2007273639 creator A5070408072 @default.
- W2007273639 date "2009-11-01" @default.
- W2007273639 modified "2023-10-17" @default.
- W2007273639 title "Space-time tradeoffs for approximate nearest neighbor searching" @default.
- W2007273639 cites W1537140306 @default.
- W2007273639 cites W1964669678 @default.
- W2007273639 cites W1967952322 @default.
- W2007273639 cites W1970319631 @default.
- W2007273639 cites W1973949696 @default.
- W2007273639 cites W1983067644 @default.
- W2007273639 cites W2024409132 @default.
- W2007273639 cites W2025791989 @default.
- W2007273639 cites W2031671531 @default.
- W2007273639 cites W2039289489 @default.
- W2007273639 cites W2045134120 @default.
- W2007273639 cites W2054011861 @default.
- W2007273639 cites W2071572981 @default.
- W2007273639 cites W2086591901 @default.
- W2007273639 cites W2088101210 @default.
- W2007273639 cites W2101886696 @default.
- W2007273639 cites W2105246008 @default.
- W2007273639 cites W2107342718 @default.
- W2007273639 cites W2120838877 @default.
- W2007273639 cites W2144397897 @default.
- W2007273639 cites W2147717514 @default.
- W2007273639 cites W2151942047 @default.
- W2007273639 cites W2165576953 @default.
- W2007273639 cites W2168532736 @default.
- W2007273639 cites W2169036209 @default.
- W2007273639 cites W2220451813 @default.
- W2007273639 cites W2427881153 @default.
- W2007273639 cites W4248484045 @default.
- W2007273639 doi "https://doi.org/10.1145/1613676.1613677" @default.
- W2007273639 hasPublicationYear "2009" @default.
- W2007273639 type Work @default.
- W2007273639 sameAs 2007273639 @default.
- W2007273639 citedByCount "70" @default.
- W2007273639 countsByYear W20072736392012 @default.
- W2007273639 countsByYear W20072736392013 @default.
- W2007273639 countsByYear W20072736392014 @default.
- W2007273639 countsByYear W20072736392015 @default.
- W2007273639 countsByYear W20072736392016 @default.
- W2007273639 countsByYear W20072736392017 @default.
- W2007273639 countsByYear W20072736392018 @default.
- W2007273639 countsByYear W20072736392019 @default.
- W2007273639 countsByYear W20072736392020 @default.
- W2007273639 countsByYear W20072736392021 @default.
- W2007273639 countsByYear W20072736392022 @default.
- W2007273639 countsByYear W20072736392023 @default.
- W2007273639 crossrefType "journal-article" @default.
- W2007273639 hasAuthorship W2007273639A5016442699 @default.
- W2007273639 hasAuthorship W2007273639A5022760571 @default.
- W2007273639 hasAuthorship W2007273639A5070408072 @default.
- W2007273639 hasBestOaLocation W20072736392 @default.
- W2007273639 hasConcept C111919701 @default.
- W2007273639 hasConcept C113238511 @default.
- W2007273639 hasConcept C11413529 @default.
- W2007273639 hasConcept C114614502 @default.
- W2007273639 hasConcept C118615104 @default.
- W2007273639 hasConcept C134306372 @default.
- W2007273639 hasConcept C154945302 @default.
- W2007273639 hasConcept C162319229 @default.
- W2007273639 hasConcept C199360897 @default.
- W2007273639 hasConcept C2524010 @default.
- W2007273639 hasConcept C2778572836 @default.
- W2007273639 hasConcept C28719098 @default.
- W2007273639 hasConcept C33676613 @default.
- W2007273639 hasConcept C33923547 @default.
- W2007273639 hasConcept C41008148 @default.
- W2007273639 hasConcept C42747912 @default.
- W2007273639 hasConcept C63553672 @default.
- W2007273639 hasConceptScore W2007273639C111919701 @default.
- W2007273639 hasConceptScore W2007273639C113238511 @default.
- W2007273639 hasConceptScore W2007273639C11413529 @default.
- W2007273639 hasConceptScore W2007273639C114614502 @default.
- W2007273639 hasConceptScore W2007273639C118615104 @default.
- W2007273639 hasConceptScore W2007273639C134306372 @default.
- W2007273639 hasConceptScore W2007273639C154945302 @default.
- W2007273639 hasConceptScore W2007273639C162319229 @default.
- W2007273639 hasConceptScore W2007273639C199360897 @default.
- W2007273639 hasConceptScore W2007273639C2524010 @default.
- W2007273639 hasConceptScore W2007273639C2778572836 @default.
- W2007273639 hasConceptScore W2007273639C28719098 @default.
- W2007273639 hasConceptScore W2007273639C33676613 @default.
- W2007273639 hasConceptScore W2007273639C33923547 @default.
- W2007273639 hasConceptScore W2007273639C41008148 @default.
- W2007273639 hasConceptScore W2007273639C42747912 @default.
- W2007273639 hasConceptScore W2007273639C63553672 @default.
- W2007273639 hasFunder F4320306076 @default.
- W2007273639 hasFunder F4320321592 @default.
- W2007273639 hasFunder F4320337345 @default.
- W2007273639 hasIssue "1" @default.
- W2007273639 hasLocation W20072736391 @default.
- W2007273639 hasLocation W20072736392 @default.