90 search results - page 10 / 18 » Suffix tree construction algorithms on modern hardware |
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we study the buffered clock tree synthesis problem under thermal variations for 3D IC technology. Our major contribution is the Balanced Skew Theorem, which provides...
AICCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
— This work develops an analytic framework for clock tree analysis considering process variations that is shown to correspond well with Monte Carlo results. The analysis framewor...
EUROCAST
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...