5138 search results - page 120 / 1028 » Randomized Algorithms for 3-SAT |
119
click to vote
MOC
2000
15 years 1 months ago
2000
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
116
click to vote
STOC
2005
ACM
15 years 7 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
126
click to vote
ICARCV
2002
IEEE
15 years 6 months ago
2002
IEEE
We will develop a manipulator system that can handle randomly located, moving parts. Vision algorithm to detect the planar motion of a part is implemented on an FPGA-based realtim...
112
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...