653 search results - page 75 / 131 » The size of minimum 3-trees |
CORR
2006
Springer
14 years 12 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
CCE
2007
14 years 12 months ago
2007
Design and control of recycle systems must be integrated at an early design stage. By placing together the pieces of the design puzzle we developed a novel methodology that allows...
104
click to vote
JCP
2008
14 years 12 months ago
2008
Sleep transistors in industrial power-gating designs are custom designed with an optimal size. Consequently, sleep transistor P/G network optimization becomes a problem of finding ...
104
click to vote
IOR
2006
14 years 12 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
107
click to vote
JCT
2006
14 years 12 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...