Sciweavers

1059 search results - page 50 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
GLOBECOM
2008
IEEE
15 years 4 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
UAI
1997
14 years 11 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
ICPR
2008
IEEE
15 years 4 months ago
Boosting Gaussian mixture models via discriminant analysis
The Gaussian mixture model (GMM) can approximate arbitrary probability distributions, which makes it a powerful tool for feature representation and classification. However, it su...
Hao Tang, Thomas S. Huang
INFOCOM
2003
IEEE
15 years 3 months ago
Improving Web Performance in Broadcast-Unicast Networks
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Sriniv...
CAV
2001
Springer
154views Hardware» more  CAV 2001»
15 years 1 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...