Sciweavers

673 search results - page 71 / 135
» Biometric random number generators
Sort
View
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 8 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 8 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
INFOCOM
2007
IEEE
14 years 2 months ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff
DAGSTUHL
2006
13 years 9 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 7 months ago
Distributed Source Coding in the Presence of Byzantine Sensors
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
Oliver Kosut, Lang Tong