5153 search results - page 667 / 1031 » Introduction to Randomized Algorithms |
219
click to vote
CORR
2011
Springer
15 years 1 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...
179
click to vote
ECCC
2011
15 years 1 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
207
click to vote
TIT
2010
15 years 1 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
223
click to vote
DAIS
2011
14 years 10 months ago
2011
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
333
click to vote
CCS
2011
ACM
14 years 6 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...