1550 search results - page 55 / 310 » Benchmarking for Graph Transformation |
EVOW
2006
Springer
14 years 2 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
ICSM
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
IWOMP
2009
Springer
14 years 5 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
JMLR
2008
13 years 11 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...