Skip to search formSkip to main contentSkip to account menu

Variable elimination

Variable elimination (VE) is a simple and general exact inference algorithm in probabilistic graphical models, such as Bayesian networks and Markov… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Automatic vectorizationBayesian networkConstraint logic programmingConstraint satisfaction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Knowledge Compilation for Lifted Probabilistic Inference: Compiling to a Low-Level Language
Algorithms based on first-order knowledge compilation are currently the state-of-the-art for lifted inference. These algorithms… 
2012
2012
Lifted Variable Elimination with Arbitrary Constraints
Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more… 
2011
2011
Towards Completely Lifted Search-based Probabilistic Inference
The promise of lifted probabilistic inference is to carry out probabilistic inference in a relational probabilistic model without… 
2006
2006
The application of piecewise direct standardisation with variable selection to the correction of drift in inductively coupled atomic emission spectrometry
When an instrument response is measured over a period of time changes in the signal intensity can occur. If this happens… 
2006
2006
Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models
We observe that certain large-clique graph tri-angulations can be useful for reducing computational requirements when making… 
2001
2001
A simultaneous estimation and variable selection rule
2000
2000
Data dependence analysis for array references
1995
1995
Max-planck-institut F Ur Informatik Ordered Chaining Calculi for First-order Theories of Binary Relations K I N F O R M a T I K Authors' Addresses Publication Notes
We propose inference systems for binary relations with composition laws of the form S T U in the context of resolution-type… 
Highly Cited
1980
Highly Cited
1980
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities
A modified resolution procedure is described which has been designed to prove theorems about general linear inequalities. This… 
Review
1970
Review
1970
Sparsity-Directed Decomposition for Gaussian Elimination on Matrices
This is a concise critical survey of the theory and practice relating to the ordered Gaussian elimination on sparse systems. A… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)