1722 search results - page 222 / 345 » On the sample mean of graphs |
154
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
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...
210
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
149
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
217
click to vote
AMDO
2010
Springer
15 years 4 months ago
2010
Springer
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
158
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...