107 search results - page 6 / 22 » Tight Results on Minimum Entropy Set Cover |
122
Voted
ICML
2004
IEEE
15 years 7 months ago
2004
IEEE
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
126
Voted
COCO
2004
Springer
15 years 5 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
110
Voted
TCS
2008
15 years 1 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
110
Voted
AAIM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
116
Voted
ALMOB
2006
15 years 1 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...