71 search results - page 5 / 15 » On the Complexity of Reliable Root Approximation |
UAI
1996
13 years 9 months ago
1996
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
CIKM
2003
Springer
14 years 26 days ago
2003
Springer
As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. Few users wish to retri...
GMP
2002
IEEE
14 years 18 days ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
ENTCS
2006
13 years 7 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...