557 search results - page 11 / 112 » On the convergence time of distributed quantized averaging a... |
COLT
2000
Springer
13 years 12 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
AAAI
2006
13 years 9 months ago
2006
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
ICS
1989
Tsinghua U.
13 years 11 months ago
1989
Tsinghua U.
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...