Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels (Q4635566)
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 6863042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels |
scientific article; zbMATH DE number 6863042 |
Statements
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels (English)
0 references
23 April 2018
0 references
\(\varepsilon\)-dependencies
0 references
bichromatic closest pair
0 references
coresets
0 references
minimum spanning tree
0 references
nearest neighbor
0 references
0.8154732584953308
0 references
0.8147470355033875
0 references
0.8103917837142944
0 references
0.79743492603302
0 references
