Sciweavers

1434 search results - page 196 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICS
2010
Tsinghua U.
14 years 7 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
IPPS
2008
IEEE
14 years 4 months ago
ContinuStreaming: Achieving high playback continuity of Gossip-based Peer-to-Peer streaming
Gossip-based Peer-to-Peer(P2P) streaming has been proved to be an effective and resilient method to stream qualified media contents in dynamic and heterogeneous network environme...
Zhenhua Li, Jiannong Cao, Guihai Chen
IPPS
2008
IEEE
14 years 4 months ago
On performance bottleneck of anonymous communication networks
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
Ryan Pries, Wei Yu, Steve Graham, Xinwen Fu
IPPS
2007
IEEE
14 years 4 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...
NCA
2007
IEEE
14 years 4 months ago
A Topological Analysis of Monitor Placement
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
Alden W. Jackson, Walter C. Milliken, Cesar A. San...