2270 search results - page 264 / 454 » On the distribution of eigenvalues of graphs |
228
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
188
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
This paper presents a novel approach of multiple target tracking from multiple collaborative cameras. Firstly, particle filtering for conditional density propagation on graphs to...
197
click to vote
PODC
2006
ACM
16 years 1 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
194
click to vote
WDAG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
171
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...