Sciweavers

440 search results - page 19 / 88
» Comparison of Galled Trees
Sort
View
APPML
2007
154views more  APPML 2007»
13 years 8 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
BMCBI
2008
104views more  BMCBI 2008»
13 years 8 months ago
Comparison of methods for estimating the nucleotide substitution matrix
Background: The nucleotide substitution rate matrix is a key parameter of molecular evolution. Several methods for inferring this parameter have been proposed, with different math...
Maribeth Oscamou, Daniel McDonald, Von Bing Yap, G...
MST
2002
107views more  MST 2002»
13 years 8 months ago
A Comparison of Asymptotically Scalable Superscalar Processors
The poor scalability of existing superscalar processors has been of great concern to the computer engineering community. In particular, the critical-path lengths of many components...
Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh
ICCD
1997
IEEE
87views Hardware» more  ICCD 1997»
14 years 29 days ago
Synthesizing Iterative Functions into Delay-Insensitive Tree Circuits
Speed, cost and correctness may be the most important factors in designing a digital system. This paper proposes a novel and general methodology to synthesize iterative functions ...
Fu-Chiung Cheng
SPAA
1996
ACM
14 years 27 days ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher