315 search results - page 10 / 63 » Eigenvalue bounds for independent sets |
ICCD
2003
IEEE
14 years 6 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
DM
2008
13 years 10 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
ISIPTA
2003
IEEE
14 years 3 months ago
2003
IEEE
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f(X) and g(Y) behaves in a certain way: the interval of expected values E...
GC
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...