Sciweavers

2612 search results - page 109 / 523
» Switching Graphs and Their Complexity
Sort
View
CORR
2008
Springer
149views Education» more  CORR 2008»
14 years 10 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
IJCNN
2007
IEEE
15 years 4 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
15 years 4 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
AMW
2010
14 years 11 months ago
Minimising RDF Graphs under Rules and Constraints Revisited
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 4 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez