5153 search results - page 105 / 1031 » Introduction to Randomized Algorithms |
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...
148
click to vote
SODA
2001
ACM
15 years 3 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...
113
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...
148
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
119
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...