5115 search results - page 98 / 1023 » On Randomized Lanczos Algorithms |
132
Voted
ICARCV
2002
IEEE
15 years 7 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...
120
Voted
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 4 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...
150
Voted
SODA
2001
ACM
15 years 4 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...
115
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...