Sciweavers

5 search results - page 1 / 1
» A Range Minima Parallel Algorithm for Coarse Grained Multico...
Sort
View
PDP
2003
IEEE
13 years 10 months ago
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
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 ...
Thierry Garcia, Jean Frédéric Myoupo...
IPPS
1997
IEEE
13 years 9 months ago
d-Dimensional Range Search on Multicomputers
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...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
IPPS
1999
IEEE
13 years 9 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
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...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
TC
2010
13 years 3 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—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...
Yinglong Xia, Viktor K. Prasanna