Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data (Q2200557)
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: Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data |
scientific article |
Statements
Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data (English)
0 references
22 September 2020
0 references
approximate nearest neighbor search
0 references
high-dimensional data
0 references
progressive lower bound
0 references
statistical lower bound
0 references
