Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,101,582 papers from all fields of science
Search
Sign In
Create Free Account
Variable elimination
Variable elimination (VE) is a simple and general exact inference algorithm in probabilistic graphical models, such as Bayesian networks and Markov…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Automatic vectorization
Bayesian network
Constraint logic programming
Constraint satisfaction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A performance evaluation of three inference engines as expert systems for failure mode identification in shafts
C. Moreno
,
Edgar Espejo
2015
Corpus ID: 15835076
2012
2012
Lifted Variable Elimination with Arbitrary Constraints
N. Taghipour
,
Daan Fierens
,
Jesse Davis
,
H. Blockeel
International Conference on Artificial…
2012
Corpus ID: 5890954
Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more…
Expand
2011
2011
Towards Completely Lifted Search-based Probabilistic Inference
D. Poole
,
F. Bacchus
,
Jacek Kisynski
arXiv.org
2011
Corpus ID: 16435994
The promise of lifted probabilistic inference is to carry out probabilistic inference in a relational probabilistic model without…
Expand
2006
2006
Fast illegal state identification for improving SAT-based induction
Vishnu C. Vimjam
,
M. Hsiao
43rd ACM/IEEE Design Automation Conference
2006
Corpus ID: 669392
In this paper, we propose a novel framework to quickly extract illegal states of a sequential circuit and then use them as…
Expand
2006
2006
The application of piecewise direct standardisation with variable selection to the correction of drift in inductively coupled atomic emission spectrometry
M. Griffiths
,
D. Svozil
,
P. Worsfold
,
E. Evans
2006
Corpus ID: 44241315
When an instrument response is measured over a period of time changes in the signal intensity can occur. If this happens…
Expand
2006
2006
Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models
C. Bartels
,
J. Bilmes
Conference on Uncertainty in Artificial…
2006
Corpus ID: 2168935
We observe that certain large-clique graph tri-angulations can be useful for reducing computational requirements when making…
Expand
2001
2001
A simultaneous estimation and variable selection rule
Amos Golan
2001
Corpus ID: 32540205
2000
2000
Data dependence analysis for array references
Tsung-Chuan Huang
,
Cheng-Ming Yang
Journal of Systems and Software
2000
Corpus ID: 28298960
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
L. Bachmair
,
H. Ganzinger
1995
Corpus ID: 33869039
We propose inference systems for binary relations with composition laws of the form S T U in the context of resolution-type…
Expand
Review
1970
Review
1970
Sparsity-Directed Decomposition for Gaussian Elimination on Matrices
E. C. Ogbuobiri
,
W. Tinney
,
Senior Member
,
John W. Walker
1970
Corpus ID: 16450785
This is a concise critical survey of the theory and practice relating to the ordered Gaussian elimination on sparse systems. A…
Expand
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)
ACCEPT & CONTINUE