1612 search results - page 258 / 323 » Analysing Randomized Distributed Algorithms |
116
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
183
click to vote
CCS
2011
ACM
13 years 9 months ago
2011
ACM
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
118
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
139
click to vote
SIGMOD
2011
ACM
14 years 18 days ago
2011
ACM
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...