Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616): Difference between revisions

@@ Property / DOI @@
-.1007/s10994-010-5233-4
@@ Property / DOI: 10.1007/s10994-010-5233-4 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2048041057
@@ Property / OpenAlex ID: W2048041057 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6825
@@ Property / arXiv ID: 1206.6825 / rank @@
+Normal rank
@@ Property / cites work @@
+The generalized distributive law
@@ Property / cites work: The generalized distributive law / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q3624187
@@ Property / cites work: Q3624187 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Nonserial dynamic programming
@@ Property / cites work: Nonserial dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+On probabilistic inference by weighted model counting
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive conditioning
@@ Property / cites work: Recursive conditioning / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217791
@@ Property / cites work: Q4217791 / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Topological parameters for time-space tradeoff
@@ Property / cites work: Topological parameters for time-space tradeoff / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3201783
@@ Property / cites work: Q3201783 / rank @@
+Normal rank
@@ Property / cites work @@
+Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
+Normal rank
@@ Property / cites work @@
+Q4382293
@@ Property / cites work: Q4382293 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4734791
@@ Property / cites work: Q4734791 / rank @@
+Normal rank
@@ Property / cites work @@
+AND/OR search spaces for graphical models
@@ Property / cites work: AND/OR search spaces for graphical models / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
+Normal rank
@@ Property / cites work @@
+How to use the minimal separators of a graph for its chordal triangulation
+Normal rank
@@ Property / cites work @@
+The Use of Linear Graphs in Gauss Elimination
@@ Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997653
@@ Property / cites work: Q3997653 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q3979385
@@ Property / cites work: Q3979385 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4809068
@@ Property / cites work: Q4809068 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10994-010-5233-4
@@ Property / DOI: 10.1007/S10994-010-5233-4 / rank @@
+Normal rank