A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5925661)
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: A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee |
scientific article; zbMATH DE number 7666338
| 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 7666338 |
Statements
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (English)
0 references
21 March 2023
0 references
computation geometry
0 references
approximate k-nearest-neighbors
0 references
