Sciweavers

307 search results - page 57 / 62
» Finite locally-quasiprimitive graphs
Sort
View
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
13 years 10 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 10 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 10 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
CVIU
2008
188views more  CVIU 2008»
13 years 10 months ago
Learning function-based object classification from 3D imagery
We propose a novel scheme for using supervised learning for function-based classification of objects in 3D images. During the learning process, a generic multi-level hierarchical ...
Michael Pechuk, Octavian Soldea, Ehud Rivlin
ECCC
2010
89views more  ECCC 2010»
13 years 10 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky