The complexity of finding minimal Voronoi covers with applications to machine learning (Q1314528)

From MaRDI portal
Revision as of 13:06, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of finding minimal Voronoi covers with applications to machine learning
scientific article

    Statements

    The complexity of finding minimal Voronoi covers with applications to machine learning (English)
    0 references
    0 references
    0 references
    29 November 1994
    0 references
    0 references
    0 references
    0 references
    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 references