2 search results - page 1 / 1 » Methods for Constructing Balanced Elimination Trees and Othe... |
FLAIRS
2006
13 years 6 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
SAS
1999
Springer
13 years 9 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...