168 search results - page 12 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
88
Voted
SPDP
1991
IEEE
15 years 5 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
123
Voted
CIARP
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
136
Voted
CRYPTO
2010
Springer
15 years 3 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
108
Voted
CCCG
2010
15 years 3 months ago
2010
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
117
Voted
ISTCS
1993
Springer
15 years 6 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...