Sciweavers

1550 search results - page 17 / 310
» Benchmarking for Graph Transformation
Sort
View
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 9 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
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...
András A. Benczúr, David R. Karger
ICCV
2011
IEEE
12 years 9 months ago
Robust Topological Features for Deformation Invariant Image Matching
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...
Edgar Lobaton, Ramanarayan Vasudevan, Ron Alterovi...
ICLP
2007
Springer
14 years 4 months ago
Static Region Analysis for Mercury
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...
Quan Phan, Gerda Janssens
CEC
2010
IEEE
13 years 10 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— 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...
Peter Korosec, Katerina Taskova, Jurij Silc
STTT
2010
134views more  STTT 2010»
13 years 8 months ago
A case study to evaluate the suitability of graph transformation tools for program refactoring
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...
Francisco Javier Pérez, Yania Crespo, Berth...