Sciweavers

141 search results - page 5 / 29
» Approximate algorithms for credal networks with binary varia...
Sort
View
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 6 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
AAAI
2007
13 years 8 months ago
Unscented Message Passing for Arbitrary Continuous Variables in Bayesian Networks
Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. Ho...
Wei Sun, Kuo-Chu Chang
ICASSP
2009
IEEE
14 years 1 months ago
Decentralized variational filtering for simultaneous sensor localization and target tracking in binary sensor networks
Resource limitations in wireless sensor networks have put stringent constraints on distributed signal processing. In this paper, we propose a cluster-based decentralized variation...
Jing Teng, Hichem Snoussi, Cédric Richard
NIPS
2003
13 years 7 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
ICA
2010
Springer
13 years 7 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...