Sciweavers

653 search results - page 17 / 131
» The size of minimum 3-trees
Sort
View
102
Voted
CODES
2009
IEEE
15 years 24 days ago
Squashing microcode stores to size in embedded systems while delivering rapid microcode accesses
Microcoded customized IPs offer superior performance and direct programmability of micro-architectural structures compared to instruction-based processors, yet at the cost of dra...
Chengmo Yang, Mingjing Chen, Alex Orailoglu
DM
2010
102views more  DM 2010»
14 years 9 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
DATE
2008
IEEE
75views Hardware» more  DATE 2008»
15 years 4 months ago
Wire Sizing Alternative - An Uniform Dual-rail Routing Architecture
To achieve minimum signal propagation delay, the nonuniform wire width routing architecture has been widely used in modern VLSI design. The non-uniform routing architecture exploi...
Fu-Wei Chen, Yi-Yu Liu
COCOA
2009
Springer
15 years 2 months ago
Variable-Size Rectangle Covering
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
15 years 3 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo