138 search results - page 25 / 28 » Graph Laplacians and their convergence on random neighborhoo... |
167
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
205
Voted
TSP
2010
15 years 23 days ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
170
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
146
click to vote
SRDS
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
174
click to vote
IROS
2007
IEEE
16 years 11 days ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...