Sciweavers

1830 search results - page 123 / 366
» Workshop on Graph Computation Models
Sort
View
ICPR
2010
IEEE
15 years 4 months ago
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
Gerard Sanromà, René Alquézar...
COR
2006
94views more  COR 2006»
15 years 4 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
ICCS
2009
Springer
15 years 11 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...
ICMT
2010
Springer
15 years 9 months ago
Synthesis of OCL Pre-conditions for Graph Transformation Rules
Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use,...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
DATE
2008
IEEE
131views Hardware» more  DATE 2008»
15 years 11 months ago
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...