563 search results - page 17 / 113 » Computing approximate PSD factorizations |
114
click to vote
JMLR
2010
14 years 7 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
113
Voted
NIPS
2007
15 years 2 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
93
Voted
SIAMSC
2008
15 years 29 days ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
104
Voted
IDA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...