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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10994-010-5233-4 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62H22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6031865 / rank
 
Normal rank
Property / zbMATH Keywords
 
triangulation
Property / zbMATH Keywords: triangulation / rank
 
Normal rank
Property / zbMATH Keywords
 
inference
Property / zbMATH Keywords: inference / rank
 
Normal rank
Property / zbMATH Keywords
 
graphical models
Property / zbMATH Keywords: graphical models / rank
 
Normal rank
Property / zbMATH Keywords
 
graph theory
Property / zbMATH Keywords: graph theory / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048041057 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.6825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized distributive law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On probabilistic inference by weighted model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological parameters for time-space tradeoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR search spaces for graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulation of a graph and optimal pivoting order in a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use the minimal separators of a graph for its chordal triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809068 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10994-010-5233-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:55, 9 December 2024

scientific article
Language Label Description Also known as
English
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
scientific article

    Statements

    Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (English)
    0 references
    0 references
    0 references
    8 May 2012
    0 references
    triangulation
    0 references
    inference
    0 references
    graphical models
    0 references
    graph theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references