Refinements to nearest-neighbor searching in k-dimensional trees (Q802864)
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: Refinements to nearest-neighbor searching in k-dimensional trees |
scientific article; zbMATH DE number 4199613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Refinements to nearest-neighbor searching in k-dimensional trees |
scientific article; zbMATH DE number 4199613 |
Statements
Refinements to nearest-neighbor searching in k-dimensional trees (English)
0 references
1991
0 references
nearest-neighbor searching
0 references
k-dimensional trees
0 references
0.9189261
0 references
0.91614306
0 references
0.91464305
0 references
0.9077077
0 references
0.8993195
0 references
0.89487773
0 references
0.89426345
0 references
0.88070077
0 references
