Sciweavers

288 search results - page 11 / 58
» random 1998
Sort
View
PODC
1998
ACM
15 years 2 months ago
Amortizing Randomness in Private Multiparty Computations
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
APJOR
2010
118views more  APJOR 2010»
14 years 8 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura
TIT
1998
90views more  TIT 1998»
14 years 9 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
RANDOM
1998
Springer
15 years 2 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
MOC
1998
83views more  MOC 1998»
14 years 9 months ago
A sweep-plane algorithm for generating random tuples in simple polytopes
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
Josef Leydold, Wolfgang Hörmann