Sciweavers

49 search results - page 1 / 10
» Maximum Likelihood Bounded Tree-Width Markov Networks
Sort
View
UAI
2001
13 years 6 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
JSC
2006
95views more  JSC 2006»
13 years 4 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 6 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
TIT
2008
102views more  TIT 2008»
13 years 4 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
IJBRA
2006
107views more  IJBRA 2006»
13 years 4 months ago
Probabilistic models for biological sequences: selection and Maximum Likelihood estimation
: Probabilistic models for biological sequences (DNA and proteins) are frequently used in bioinformatics. We describe statistical tests designed to detect the order of dependency a...
Svetlana Ekisheva, Mark Borodovsky