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 the normal view instead:
scientific article; zbMATH DE number 7250198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data |
scientific article; zbMATH DE number 7250198 |
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
0.7561707496643066
0 references
0.7484551072120667
0 references
0.7395300269126892
0 references
0.7311776876449585
0 references
