Sciweavers

492 search results - page 2 / 99
» The number of possibilities for random dating
Sort
View
WSC
2001
13 years 6 months ago
Using common random numbers for indifference-zone selection
This paper discusses the validity of using common random numbers (CRNs) with two-stage selection procedures to improve the possibility of correct selection and discusses the intri...
E. Jack Chen
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
13 years 6 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
BIOCOMP
2006
13 years 6 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
13 years 10 months ago
A probabilistic loading-dependent model of cascading failure and possible implications for blackouts
Catastrophic disruptions of large, interconnected infrastructure systems are often due to cascading failure. For example, large blackouts of electric power systems are typically c...
Ian Dobson, Benjamin A. Carreras, David E. Newman
WSC
2008
13 years 7 months ago
Comparing two systems: Beyond common random numbers
Suppose one wishes to compare two closely related systems via stochastic simulation. Common random numbers (CRN) involves using the same streams of uniform random variates as inpu...
Samuel Ehrlichman, Shane G. Henderson