578 search results - page 39 / 116 » The Minimum-Entropy Set Cover Problem |
ALMOB
2006
13 years 8 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Gesture recognition is a difficult task in computer vision due to the numerous degrees of freedom of a human hand. Fortunately, human gesture covers only a small part of the theor...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
CONSTRAINTS
2007
13 years 8 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....