Sciweavers

91 search results - page 5 / 19
» A supertree method for rooted trees
Sort
View
IPL
2002
74views more  IPL 2002»
15 years 1 days ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
ICCAD
1998
IEEE
105views Hardware» more  ICCAD 1998»
15 years 4 months ago
Fanout optimization under a submicron transistor-level delay model
In this paper we present a new fanout optimization algorithm which is particularly suitable for digital circuits designed with submicron CMOS technologies. Restricting the class o...
Pasquale Cocchini, Massoud Pedram, Gianluca Piccin...
99
Voted
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 7 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
BMCBI
2010
118views more  BMCBI 2010»
15 years 14 days ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
SPIRE
2001
Springer
15 years 4 months ago
On Compression of Parse Trees
We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path fr...
Jorma Tarhio