Sciweavers

1612 search results - page 48 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
INFOCOM
2012
IEEE
13 years 6 days ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
ICASSP
2010
IEEE
14 years 8 months ago
Learning in Gaussian Markov random fields
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown par...
Thomas J. Riedl, Andrew C. Singer, Jun Won Choi
SECON
2008
IEEE
15 years 4 months ago
On Distributed Optimization Using Peer-to-Peer Communications in Wireless Sensor Networks
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
Björn Johansson, Cesare M. Carretti, Mikael J...
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 3 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
SAC
2010
ACM
15 years 4 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar