107 search results - page 3 / 22 » Tight Results on Minimum Entropy Set Cover |
DM
2007
13 years 6 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
AI
1998
Springer
13 years 6 months ago
1998
Springer
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
WG
2007
Springer
14 years 10 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
JMLR
2002
13 years 5 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...