Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data (Q2200557): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SIFT / rank | |||
Normal rank | |||
Revision as of 01:48, 29 February 2024
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
