1640 search results - page 23 / 328 » Conditional Independence Trees |
FLAIRS
2006
13 years 11 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...
SOCO
2008
Springer
13 years 9 months ago
2008
Springer
Superimposition is a composition technique that has been applied successfully in several areas of software development. In order to unify several languages and tools that rely on s...
ESA
2011
Springer
12 years 9 months ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
UAI
1994
13 years 11 months ago
1994
Heckerman (1993) defined causal independence in terms of a set of temporal conditional independence statements. These statements formalized certain types of causal interaction whe...
AGP
1995
IEEE
14 years 1 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...