2084 search results - page 3 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
JCST
2010
13 years 2 days ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...