2084 search results - page 139 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
142
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Collaborative beamforming has been recently introduced in the context of wireless sensor networks (WSNs) to increase the transmission range of individual sensor nodes. In this pap...
149
Voted
3DIM
2001
IEEE
15 years 8 months ago
2001
IEEE
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
243
click to vote
SIGAL
1990
15 years 9 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
155
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
107
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...