Sciweavers

210 search results - page 3 / 42
» On the convergence of a factorized distribution algorithm wi...
Sort
View
INFOCOM
2007
IEEE
14 years 17 days ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
ICDCS
2009
IEEE
14 years 3 months ago
The Impact of Communication Models on Routing-Algorithm Convergence
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...
Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. W...
ICASSP
2011
IEEE
12 years 10 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ICPR
2010
IEEE
14 years 1 months ago
Bayesian Inference for Nonnegative Matrix Factor Deconvolution Models
In this paper we develop a probabilistic interpretation and a full Bayesian inference for non-negative matrix deconvolution (NMFD) model. Our ultimate goal is unsupervised extract...
Serap Kirbiz, Ali Taylan Cemgil, Bilge Gunsel
UAI
2003
13 years 7 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...