Graph-based time-space trade-offs for approximate near neighbors (Q5115825)
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: Graph-based time-space trade-offs for approximate near neighbors |
scientific article; zbMATH DE number 7236461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph-based time-space trade-offs for approximate near neighbors |
scientific article; zbMATH DE number 7236461 |
Statements
18 August 2020
0 references
approximate nearest neighbor problem
0 references
near neighbor graphs
0 references
locality-sensitive hashing
0 references
locality-sensitive filters
0 references
similarity search
0 references
0 references
0 references
0 references
0 references
0 references
0.8082011342048645
0 references
0.7822320461273193
0 references
0.7618556022644043
0 references
