16404 search results - page 752 / 3281 » A set coverage problem |
164
click to vote
JC
2007
15 years 7 months ago
2007
We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges ...
228
click to vote
CSDA
2004
15 years 7 months ago
2004
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
173
click to vote
SIAMDM
2010
15 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
210
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
160
click to vote
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...