Sciweavers

336 search results - page 11 / 68
» Analytic Cut Trees
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
WABI
2010
Springer
141views Bioinformatics» more  WABI 2010»
13 years 6 months ago
An Experimental Study of Quartets MaxCut and Other Supertree Methods
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
M. Shel Swenson, Rahul Suri, C. Randal Linder, Tan...
CVPR
2010
IEEE
14 years 3 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
BMCBI
2004
87views more  BMCBI 2004»
13 years 7 months ago
Selection of informative clusters from hierarchical cluster tree with gene classes
Background: A common clustering method in the analysis of gene expression data has been hierarchical clustering. Usually the analysis involves selection of clusters by cutting the...
Petri Törönen
AAAI
2007
13 years 10 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel