Sciweavers

106 search results - page 10 / 22
» Dominating direct products of graphs
Sort
View
ECEASST
2006
103views more  ECEASST 2006»
13 years 7 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ICALP
2003
Springer
14 years 17 days ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
JMLR
2006
148views more  JMLR 2006»
13 years 7 months ago
Walk-Sums and Belief Propagation in Gaussian Graphical Models
We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of var...
Dmitry M. Malioutov, Jason K. Johnson, Alan S. Wil...
ICIAP
2003
ACM
14 years 7 months ago
A shortest path representation for video summarisation
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
Sarah V. Porter, Majid Mirmehdi, Barry T. Thomas