2095 search results - page 200 / 419 » Improved pebbling bounds |
202
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
177
click to vote
JGT
2010
15 years 1 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
133
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper studies conditions under which a signal can be reconstructed from partial frequency content. We focus on signals in shiftinvariant spaces generated by multiple generato...
160
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
160
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...