Sciweavers

NETWORKS
2006
13 years 10 months ago
A simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Ethan D. Bolker, Thomas Zaslavsky
AUTOMATICA
2010
129views more  AUTOMATICA 2010»
13 years 11 months ago
Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
Dimos V. Dimarogonas, Karl Henrik Johansson
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 12 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
ISIM
2007
14 years 7 days ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...