182 search results - page 25 / 37 » Extremal Problems For Transversals In Graphs With Bounded De... |
128
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
159
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
139
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
139
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
139
click to vote
TCS
2008
15 years 4 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...