100 search results - page 14 / 20 » Optimising Graph Partitions Using Parallel Evolution |
COORDINATION
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
HPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...