6437 search results - page 228 / 1288 » Parallel Algorithms for Arrangements |
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
118
click to vote
GM
1999
Springer
15 years 7 months ago
1999
Springer
This paper is concerned with various aspects of the modeling of parallel curves on surfaces with special emphasis on surfaces of revolution. An algorithm for efficient tracking of...
153
click to vote
ISMM
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
191
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
123
click to vote
SPAA
1992
ACM
15 years 7 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...