Sciweavers

903 search results - page 53 / 181
» Non-well-founded trees in categories
Sort
View
ISPD
2006
ACM
108views Hardware» more  ISPD 2006»
15 years 8 months ago
Statistical clock tree routing for robustness to process variations
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
MOBIHOC
2004
ACM
15 years 7 months ago
Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional ant
Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only energy source to power the nodes. One major metric for energy conservation is to r...
Song Guo, Oliver W. W. Yang
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 2 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 2 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
SOFSEM
1997
Springer
15 years 6 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic