5580 search results - page 143 / 1116 » Randomized priority algorithms |
STOC
2005
ACM
15 years 3 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...
ICARCV
2002
IEEE
15 years 2 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...
STOC
1994
ACM
15 years 2 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
14 years 12 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...
102
click to vote
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...