6251 search results - page 128 / 1251 » Randomness, Computability, and Density |
120
click to vote
ISPA
2004
Springer
15 years 6 months ago
2004
Springer
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
JOC
2006
15 years 20 days ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
116
Voted
HOTOS
1997
IEEE
15 years 5 months ago
1997
IEEE
Diversity is an important source of robustness in biological systems. Computers, by contrast, are notable for their lack of diversity. Although homogeneous systems have many advan...
116
click to vote
SCN
2008
Springer
15 years 19 days ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
100
Voted
EUROGP
2001
Springer
15 years 5 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...