Sciweavers

4074 search results - page 90 / 815
» Abstract Graph Transformation
Sort
View
DAGSTUHL
2007
14 years 11 months ago
Graph matching with type constraints on nodes and edges
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Catherine Fraikin, Paul Van Dooren
ICPR
2006
IEEE
15 years 11 months ago
Graph-based transformation manifolds for invariant pattern recognition with kernel methods
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a ke...
Alexei Pozdnoukhov, Samy Bengio
AUTOMATICA
2004
91views more  AUTOMATICA 2004»
14 years 9 months ago
Comparing digital implementation via the bilinear and step-invariant transformations
From an analog system K, digital systems Kd and Kbt are often obtained via the step-invariant and bilinear transformations, respectively. For the case when K is stable, it is show...
Guofeng Zhang, Tongwen Chen
VMCAI
2004
Springer
15 years 3 months ago
Symbolic Implementation of the Best Transformer
This paper shows how to achieve, under certain conditions, abstract-interpretation ms that enjoy the best possible precision for a given abstraction. The key idea is a simple proce...
Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
DIS
2007
Springer
15 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono