Sciweavers

654 search results - page 38 / 131
» Matrix Graph Grammars
Sort
View
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Soft Region Correspondence Estimation for Graph-Theoretic Image Retrieval Using Quadratic Programming Approach
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
Chuech-Yu Li, Chiou-Ting Hsu
UAI
2008
13 years 10 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
COMBINATORICS
2006
169views more  COMBINATORICS 2006»
13 years 8 months ago
The Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
Fan R. K. Chung
ICIP
2010
IEEE
13 years 6 months ago
Local two-channel critically sampled filter-banks on graphs
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
Sunil K. Narang, Antonio Ortega
STACS
2010
Springer
14 years 3 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer