83 search results - page 13 / 17 » Upper bounds on maximum likelihood for phylogenetic trees |
SIGECOM
2009
ACM
14 years 5 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
CVPR
2007
IEEE
15 years 23 days ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
STACS
2007
Springer
14 years 4 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
BMCBI
2010
13 years 11 months ago
2010
Background: The incorporation of annotated sequence information from multiple related species in commonly used databases (Ensembl, Flybase, Saccharomyces Genome Database, Wormbase...
ECRTS
2002
IEEE
14 years 3 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...