364 search results - page 35 / 73 » Computing Communities in Large Networks Using Random Walks |
212
click to vote
P2P
2009
IEEE
15 years 9 months ago
2009
IEEE
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
128
Voted
OSDI
2002
ACM
16 years 2 months ago
2002
ACM
Pangaea is a wide-area file system that supports data sharing among a community of widely distributed users. It is built on a symmetrically decentralized infrastructure that consi...
135
Voted
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
151
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
110
Voted
BROADNETS
2005
IEEE
15 years 8 months ago
2005
IEEE
—The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterize...