364 search results - page 11 / 73 » Computing Communities in Large Networks Using Random Walks |
121
Voted
IWDC
2005
Springer
15 years 2 months ago
2005
Springer
:- The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form ad hoc networks paves the way for build...
CCS
2009
ACM
15 years 4 months ago
2009
ACM
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
EURONGI
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
108
Voted
CHI
2006
ACM
15 years 9 months ago
2006
ACM
Social network-based systems usually suffer from two major limitations: they tend to rely on a single data source (e.g. email traffic), and the form of network patterns is often p...
TMC
2011
14 years 4 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...