49 search results - page 2 / 10 » Maximum Likelihood Bounded Tree-Width Markov Networks |
ICC
2007
IEEE
13 years 12 months ago
2007
IEEE
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...
SIGMETRICS
2002
ACM
13 years 5 months ago
2002
ACM
Network tomography is a process for inferring "internal" link-level delay and loss performance information based on end-to-end (edge) network measurements. These methods...
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
NIPS
1994
13 years 7 months ago
1994
We introduce a recurrent architecture having a modular structure and we formulate a training procedure based on the EM algorithm. The resulting model has similarities to hidden Ma...
JMLR
2006
13 years 5 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...