Sciweavers

5153 search results - page 667 / 1031
» Introduction to Randomized Algorithms
Sort
View
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 11 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
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...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...
ECCC
2011
207views ECommerce» more  ECCC 2011»
14 years 11 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
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...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
TIT
2010
128views Education» more  TIT 2010»
14 years 11 months ago
Shannon-theoretic limits on noisy compressive sampling
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...
Mehmet Akçakaya, Vahid Tarokh
DAIS
2011
14 years 8 months ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
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...
Amir H. Payberah, Jim Dowling, Seif Haridi
CCS
2011
ACM
14 years 4 months ago
PaperSpeckle: microscopic fingerprinting of paper
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...
Ashlesh Sharma, Lakshminarayanan Subramanian, Eric...