5 search results - page 1 / 1 » A Range Minima Parallel Algorithm for Coarse Grained Multico... |
57
Voted
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
105
click to vote
PDP
2003
IEEE
15 years 4 months ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
104
Voted
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
103
click to vote
TC
2010
14 years 10 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...