Sciweavers

5785 search results - page 30 / 1157
» Approximability of Probability Distributions
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 1 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
ICMCS
2005
IEEE
80views Multimedia» more  ICMCS 2005»
15 years 7 months ago
Dynamic Server Redirect for Multimedia Service in Distributed Peer-to-Peer Network
Peer-to-Peer (P2P) multimedia application is expected to be one of the most important services supported by the next generation networks. However, how to balance server load in re...
Ming-Ho Hsiao, Suh-Yin Lee
AMC
2006
84views more  AMC 2006»
15 years 1 months ago
Estimation of parameters in carbon sequestration models from net ecosystem exchange data
The use of net ecosystem exchange (NEE) data to estimate carbon transfer coefficients is investigated in the context of a deterministic compartmental carbon sequestration system. ...
Luther White, Frances White, Yiqi Luo, Tao Xu
INFOCOM
2007
IEEE
15 years 7 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda
TCOM
2011
138views more  TCOM 2011»
14 years 8 months ago
Exact and Asymptotic Outage Probability Analysis for Decode-and-Forward Networks
Abstract—We consider decode-and-forward cooperative networks and we derive analytical expressions as well as tractable asymptotic approximations for the outage probability of a n...
Ioannis Chatzigeorgiou, Weisi Guo, Ian J. Wassell,...