Sciweavers

2354 search results - page 228 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ASIACRYPT
2004
Springer
15 years 11 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 6 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
JCB
2008
106views more  JCB 2008»
15 years 5 months ago
Statistics of Random Protein Superpositions: p-Values for Pairwise Structure Alignment
Quantification of statistical significance is essential for the interpretation of protein structural similarity. To address this, a random model for protein structure comparison w...
James O. Wrabl, Nick V. Grishin
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
15 years 3 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
EJC
2007
15 years 5 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...