364 search results - page 33 / 73 » Computing Communities in Large Networks Using Random Walks |
122
Voted
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
161
Voted
JMLR
2008
15 years 2 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
132
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
135
click to vote
NDSS
2009
IEEE
15 years 9 months ago
2009
IEEE
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
123
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
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...