1550 search results - page 102 / 310 » Benchmarking for Graph Transformation |
132
click to vote
DGCI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
114
Voted
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
123
click to vote
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
117
click to vote
ISLPED
2003
ACM
15 years 8 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
132
click to vote
SBACPAD
2005
IEEE
15 years 9 months ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...