1541 search results - page 45 / 309 » Analysis of Random Noise and Random Walk Algorithms |
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
ADHOCNOW
2004
Springer
14 years 2 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
This paper presents a new kernel method for appearance-based object recognition, highly robust to noise and occlusion. It consists of a fully connected Markov Random Field that in...