2095 search results - page 124 / 419 » Improved pebbling bounds |
183
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
162
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
150
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
207
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
149
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...