The complexity of finding minimal Voronoi covers with applications to machine learning (Q1314528): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognizing Dirichlet tesselations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM / rank
 
Normal rank

Latest revision as of 13:06, 22 May 2024

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