16404 search results - page 272 / 3281 » A set coverage problem |
117
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
155
click to vote
COLOGNETWENTE
2007
15 years 6 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
115
click to vote
ARSCOM
2007
15 years 4 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
140
click to vote
IJAR
2006
15 years 4 months ago
2006
In this paper we present a multi-scale method based on the hybrid notion of rough fuzzy sets, coming from the combination of two models of uncertainty like vagueness by handling r...
JMLR
2007
15 years 4 months ago
2007
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...