Sciweavers

84 search results - page 3 / 17
» Deriving Non-Hierarchical Process Topologies
Sort
View
AMC
2008
78views more  AMC 2008»
13 years 10 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
ICASSP
2009
IEEE
13 years 7 months ago
Fast mean square convergence of consensus algorithms in WSNs with random topologies
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
Silvana Silva Pereira, Alba Pagès-Zamora
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 10 months ago
Contact processes and moment closure on adaptive networks
Contact processes describe the transmission of distinct properties of nodes via the links of a network. They provide a simple framework for many phenomena, such as epidemic spreadi...
Anne-Ly Do, Thilo Gross
CDC
2008
IEEE
110views Control Systems» more  CDC 2008»
13 years 11 months ago
Topological identification in networks of dynamical systems
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
Donatello Materassi, Giacomo Innocenti
DAGM
2003
Springer
14 years 3 months ago
Shape Preservation during Digitization: Tight Bounds Based on the Morphing Distance
We define strong r-similarity and the morphing distance to bound geometric distortions between shapes of equal topology. We then derive a necessary and sufficient condition for a ...
Peer Stelldinger, Ullrich Köthe