46 search results - page 3 / 10 » Parallel and Distributed Graph Cuts by Dual Decomposition |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
VECPAR
2000
Springer
13 years 11 months ago
2000
Springer
A dynamic domain decomposition strategy is proposed for the effective parallel implementation of combined finite/discrete element approaches for problems involving multi-fracture a...
ISHPC
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...