1357 search results - page 149 / 272 » Compositionality in Graph Transformation |
144
Voted
PR
2007
15 years 3 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
131
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
153
Voted
WCC
2005
Springer
15 years 9 months ago
2005
Springer
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
138
Voted
AVBPA
2003
Springer
15 years 9 months ago
2003
Springer
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
109
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...