Sciweavers

1550 search results - page 81 / 310
» Benchmarking for Graph Transformation
Sort
View
GG
2004
Springer
15 years 8 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
GD
2003
Springer
15 years 8 months ago
Intersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
ICASSP
2009
IEEE
15 years 7 months ago
High-level feature extraction using SVM with walk-based graph kernel
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
Jean-Philippe Vert, Tomoko Matsui, Shin'ichi Satoh...
LR
2011
108views more  LR 2011»
14 years 6 months ago
Modeling production networks with discrete processes by means of communities of autonomous units
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...
Hans-Jörg Kreowski, Sabine Kuske, Caroline vo...
127
Voted
LCTRTS
2007
Springer
15 years 9 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue