The sum-product algorithm: algebraic independence and computational aspects
From MaRDI portal
Recommendations
Cites work
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Connections in acyclic hypergraphs
- Existence of extensions and product extensions for discrete probability distributions
- Factor graphs and the sum-product algorithm
- Fast minimal triangulation algorithm using minimum degree criterion
- From conditional independences to factorization constraints with discrete random variables
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
- On the Desirability of Acyclic Database Schemes
- Power of Natural Semijoins
- The generalized distributive law
Cited in
(9)- Algebraic methods in sum-product phenomena
- Distribution of statistics of hidden state sequences through the sum-product algorithm
- Equivalence of compositional expressions and independence relations in compositional models
- A New Look at the Generalized Distributive Law
- Recursive sum-product algorithm for generalized outer-planar graphs
- Factor graphs and the sum-product algorithm
- Sums-of-Products and Subproblem Independence
- Algorithms and data structures for exact computation of marginals
- The sum-product algorithm on small graphs
This page was built for publication: The sum-product algorithm: algebraic independence and computational aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917827)