2095 search results - page 154 / 419 » Improved pebbling bounds |
127
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 f...
128
click to vote
CPC
2008
15 years 6 months ago
2008
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
142
click to vote
IPL
2008
15 years 6 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
157
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
142
click to vote
JCSS
2008
15 years 6 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...