A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2020.12.039 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2020.12.039 / rank | |||
Normal rank | |||
Latest revision as of 13:20, 17 December 2024
scientific article; zbMATH DE number 7300880
| 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 7300880 |
Statements
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (English)
0 references
25 January 2021
0 references
computational geometry
0 references
approximate k-nearest-neighbors
0 references
0 references
0 references
