13214 search results - page 336 / 2643 » Pseudorandomness for network algorithms |
183
click to vote
CACM
2006
15 years 6 months ago
2006
Thomas Schelling's model suggests an explanation for the existence of segregated neighborhoods in America. This paper presents a study on utilizing Schelling's model to c...
173
Voted
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
173
click to vote
IPL
2008
15 years 6 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
182
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
164
click to vote
IMC
2006
ACM
16 years 22 days ago
2006
ACM
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...