The black-box complexity of nearest-neighbor search (Q2581270): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2107342718 / rank | |||
Normal rank | |||
Revision as of 21:07, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The black-box complexity of nearest-neighbor search |
scientific article |
Statements
The black-box complexity of nearest-neighbor search (English)
0 references
9 January 2006
0 references
approximation algorithms
0 references
nearest neighbor searching
0 references
similarity search
0 references
closest point queries
0 references
doubling metric spaces
0 references
