1002 search results - page 24 / 201 » Towards Graph Programs for Graph Algorithms |
FLAIRS
2003
15 years 3 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
121
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
131
click to vote
PROCEDIA
2010
15 years 9 days ago
2010
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
112
click to vote
ICMCS
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
136
click to vote
ENTCS
2006
15 years 1 months ago
2006
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...