383 search results - page 44 / 77 » A Bound on the Total Chromatic Number |
ICCAD
1995
IEEE
14 years 1 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
TCS
2008
13 years 10 months ago
2008
Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computa...
ASPDAC
1999
ACM
14 years 2 months ago
1999
ACM
We propose a new technique called node sampling to speed up the probability-based power estimation methods. It samples and processes only a small portion of total nodes to estimat...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The energy-delay tradeoffs in wireless networks are studied using a game-theoretic framework. A multi-class multipleaccess network is considered in which users choose their transmi...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...