653 search results - page 29 / 131 » The size of minimum 3-trees |
129
click to vote
ISPD
2009
ACM
15 years 8 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
126
click to vote
IPL
2008
15 years 1 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
119
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
107
click to vote
TIT
2008
15 years 1 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
COMBINATORICS
2007
15 years 1 months ago
2007
We study the structure of a minimum dominating set of Cn 2n+1, the Cartesian product of n copies of the cycle of size 2n + 1, where 2n + 1 is a prime.