Sciweavers

3265 search results - page 112 / 653
» Representing Groups on Graphs
Sort
View
BIRTHDAY
2005
Springer
15 years 12 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
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 ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
ECCV
2010
Springer
15 years 11 months ago
Reweighted Random Walks for Graph Matching
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...
Minsu Cho (Seoul National University), Jungmin Lee...
FLAIRS
2008
15 years 8 months ago
Incorporating Latent Semantic Indexing into Spectral Graph Transducer for Text Classification
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...
Xinyu Dai, Baoming Tian, Junsheng Zhou, Jiajun Che...
GG
2008
Springer
15 years 7 months ago
Workshop on Graph Computation Models
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...
Mohamed Mosbah, Annegret Habel
JAPLL
2008
101views more  JAPLL 2008»
15 years 6 months ago
Circle graphs and monadic second-order logic
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...
Bruno Courcelle