Expected-Case Complexity of Approximate Nearest Neighbor Searching (Q4706232)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Expected-Case Complexity of Approximate Nearest Neighbor Searching |
scientific article; zbMATH DE number 1931310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Expected-Case Complexity of Approximate Nearest Neighbor Searching |
scientific article; zbMATH DE number 1931310 |
Statements
Expected-Case Complexity of Approximate Nearest Neighbor Searching (English)
0 references
19 June 2003
0 references
nearest neighbor searching
0 references
approximation
0 references
expected-case analysis
0 references
priority search
0 references
sliding-midpoint tree
0 references
0.818013072013855
0 references
