Sciweavers

1640 search results - page 66 / 328
» Conditional Independence Trees
Sort
View
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 2 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
114
Voted
FOCS
2007
IEEE
15 years 9 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
94
Voted
FOSSACS
2001
Springer
15 years 7 months ago
On the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
Irène Durand, Aart Middeldorp
117
Voted
BMCBI
2007
129views more  BMCBI 2007»
15 years 2 months ago
Inferring cellular networks - a review
In this review we give an overview of computational and statistical methods to reconstruct cellular networks. Although this area of research is vast and fast developing, we show t...
Florian Markowetz, Rainer Spang
136
Voted
UAI
2004
15 years 3 months ago
Dependent Dirichlet Priors and Optimal Linear Estimators for Belief Net Parameters
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
Peter Hooper