1146 search results - page 92 / 230 » Finite cupping sets |
DATAMINE
2008
13 years 9 months ago
2008
Learning from imbalanced datasets presents a convoluted problem both from the modeling and cost standpoints. In particular, when a class is of great interest but occurs relatively...
CCCG
2001
13 years 10 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...
AMC
2010
13 years 9 months ago
2010
This article extends the Leitmann equivalence method to a class of problems featuring conjugate points. The class is characterised by the requirement that the set of indifference ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...