1550 search results - page 17 / 310 » Benchmarking for Graph Transformation |
89
Voted
CORR
2002
Springer
15 years 17 days ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
131
Voted
ICCV
2011
IEEE
14 years 23 days ago
2011
IEEE
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
102
click to vote
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
101
click to vote
CEC
2010
IEEE
15 years 28 days ago
2010
IEEE
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
108
Voted
STTT
2010
14 years 11 months ago
2010
This article proposes a case study to evaluate the suitability of graph transformation tools for program refactoring. In order to qualify for this purpose, a graph transformation s...