3265 search results - page 112 / 653 » Representing Groups on Graphs |
139
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
266
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
139
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Spectral Graph Transducer(SGT) is one of the superior graph-based transductive learning methods for classification. As for the Spectral Graph Transducer algorithm, a good graph re...
111
click to vote
GG
2008
Springer
15 years 4 months ago
2008
Springer
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
131
click to vote
JAPLL
2008
15 years 3 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...