83 search results - page 8 / 17 » Linear probing with constant independence |
106
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
117
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
102
click to vote
ARITH
2003
IEEE
15 years 7 months ago
2003
IEEE
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
ICIP
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose a distributed 3D dynamic mesh coding system. The system is based on Slepian and Wolf’s and Wyner and Ziv’s information-theoretic results. Our system ...
100
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...