The complexity of finding minimal Voronoi covers with applications to machine learning (Q1314528)
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 503006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding minimal Voronoi covers with applications to machine learning |
scientific article; zbMATH DE number 503006 |
Statements
The complexity of finding minimal Voronoi covers with applications to machine learning (English)
0 references
29 November 1994
0 references
Voronoi diagrams
0 references
computational geometry
0 references
machine learning
0 references
NP-hard
0 references
training
0 references
nearest neighbor learning program
0 references
planar tessellation
0 references
0.713991105556488
0 references
0.7084898948669434
0 references
