5592 search results - page 379 / 1119 » On Random Betweenness Constraints |
189
Voted
SACRYPT
2007
Springer
16 years 24 days ago
2007
Springer
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
214
Voted
ADHOCNOW
2004
Springer
16 years 3 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
165
click to vote
APPROX
2010
Springer
15 years 8 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 ...
201
click to vote
CLEF
2008
Springer
15 years 7 months ago
2008
Springer
DCU participated in the ImageCLEF 2008 photo retrieval task, which aimed to evaluate diversity in Image Retrieval, submitting runs for both the English and Random language annotati...
161
click to vote
TIT
2008
15 years 6 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...