Sciweavers

9 search results - page 1 / 2
» Extending Factor Graphs so as to Unify Directed and Undirect...
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
Pascal O. Vontobel
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 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...