Sciweavers

1206 search results - page 104 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
110
Voted
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
14 years 7 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic
88
Voted
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 2 months ago
Controllability decompositions of networked systems through quotient graphs
In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearestneighbor averaging rule. By letting one node in the network take on the rol...
Simone Martini, Magnus Egerstedt, Antonio Bicchi
62
Voted
DAM
2010
66views more  DAM 2010»
15 years 26 days ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
96
Voted
CG
2004
Springer
15 years 20 days ago
Hierarchical graph maps
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
James Abello
94
Voted
IJCV
2007
208views more  IJCV 2007»
15 years 21 days ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...