Sciweavers

49 search results - page 7 / 10
» Maximum Likelihood Bounded Tree-Width Markov Networks
Sort
View
143
Voted
CSB
2003
IEEE
152views Bioinformatics» more  CSB 2003»
15 years 8 months ago
A Parallel Genetic Algorithm for Physical Mapping of Chromosomes
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
Suchendra M. Bhandarkar, Jinling Huang, Jonathan A...
100
Voted
UAI
2004
15 years 4 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
Mathias Drton, Thomas S. Richardson
131
Voted
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 7 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
166
Voted
BMCBI
2010
178views more  BMCBI 2010»
15 years 3 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
151
Voted
ICC
2008
IEEE
120views Communications» more  ICC 2008»
15 years 10 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan