Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data (Q2200557): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129491796, #quickstatements; #temporary_batch_1730109610458 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129491796 / rank | |||
Normal rank | |||
Latest revision as of 11:08, 28 October 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
