98 search results - page 16 / 20 » Application of Random Walks to Decentralized Recommender Sys... |
103
click to vote
PODC
2004
ACM
15 years 2 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
DSN
2008
IEEE
15 years 4 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
85
Voted
CC
2008
Springer
14 years 9 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
CCS
2010
ACM
14 years 8 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...