460 search results - page 74 / 92 » Bounding the locality of distributed routing algorithms |
120
click to vote
CVPR
2010
IEEE
15 years 1 months ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
130
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
115
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
119
click to vote
PODS
2008
ACM
16 years 1 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
138
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...