123 search results - page 8 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
AHSWN
2010
13 years 8 months ago
2010
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
UAI
2008
13 years 9 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...