Variable elimination

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Boolean satisfiability (SAT) and its extensions are becomin g a core technology for the analysis of systems. The SAT-based appro… (More)
  • figure 1
  • table 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The original algorithm for the SAT problem, Variable Elimination Resolution (VER/DP) has exponential space complexity. To tackle… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper describes a generalized version of the variable elimination algorithm for Bayesian networks. Variable elimination… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2000
2000
Variable elimination is the basic step of Adaptive Consistency[4]. It transforms the problem into an equivalent one, having one… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
1999
1999
A useless variable is one whose value contributes nothing to the final outcome of a computation. Such variables are unlikely to… (More)
Is this relevant?