6105 search results - page 127 / 1221 » A Parallel Algorithm for Bound-Smoothing |
173
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
159
click to vote
PPSC
1997
15 years 7 months ago
1997
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
181
click to vote
SI3D
2010
ACM
16 years 1 months ago
2010
ACM
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
173
click to vote
PKDD
2004
Springer
15 years 11 months ago
2004
Springer
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
155
click to vote
PDPTA
2007
15 years 7 months ago
2007
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...