Sciweavers

3020 search results - page 293 / 604
» Optimal partition trees
Sort
View
DAC
1996
ACM
15 years 10 months ago
Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
Guido Araujo, Sharad Malik, Mike Tien-Chien Lee
DAC
2004
ACM
15 years 10 months ago
Quadratic placement using an improved timing model
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
Bernd Obermeier, Frank M. Johannes
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
15 years 10 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
Dirk Husmeier, Frank Wright
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 7 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 6 months ago
Self-stabilization with Byzantine tolerance for global tasks
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...