128 search results - page 13 / 26 » Weak Verifiable Random Functions |
195
click to vote
POPL
2004
ACM
16 years 2 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
100
click to vote
JSAC
2010
14 years 10 months ago
2010
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
EUROCRYPT
2009
Springer
16 years 11 days ago
2009
Springer
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
109
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
- In this paper we study efficient triangular grid-based sensor deployment planning for coverage when sensor placements are perturbed by random errors around their corresponding gr...