6437 search results - page 168 / 1288 » Parallel Algorithms for Arrangements |
145
click to vote
IMCSIT
2010
14 years 9 months ago
2010
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...
100
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
102
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
108
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
116
click to vote
ICPP
2009
IEEE
15 years 16 days ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...