Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs (Q116248)
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: Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs |
scientific article from arXiv |
Statements
30 March 2016
0 references
cs.DS
0 references
cs.CV
0 references
cs.IR
0 references
cs.SI
0 references
