Net and prune: a linear time algorithm for Euclidean distance problems (Q3177751)
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: Net and prune: a linear time algorithm for Euclidean distance problems |
scientific article; zbMATH DE number 6912559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Net and prune: a linear time algorithm for Euclidean distance problems |
scientific article; zbMATH DE number 6912559 |
Statements
Net and Prune (English)
0 references
2 August 2018
0 references
clustering
0 references
linear time
0 references
nets
0 references
optimization
0 references
0.9895637035369872
0 references
0.7872570157051086
0 references
0.7754701375961304
0 references
0.7741426229476929
0 references
