Results 71 to 80 of about 98,329 (103)
Some of the next articles are maybe not open access.
A string-matching algorithm for the CREW PRAM
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Valmir C Barbosa
exaly +4 more sources
Approximating the Range Sum of a Graph on CREW PRAM
Lecture Notes in Computer Science, 2002In this paper we have studied the problem of finding the range sum of a graph G =? V,E ? which is to color the vertices of a graph with ranges from a specified set in such a way that adjacent vertices are colored with non-overlapping ranges and the sum of the lengths of the ranges is the maximum possible.
Puneet Gupta
exaly +2 more sources
A Faster CREW PRAM Algorithm for Computing Cartesian Trees
Lecture Notes in Computer Science, 2013Cartesian tree is a fundamental data structure with many applications in the areas of data structures and string processing. In this paper, we study the construction of a Cartesian tree on a parallel computation model. We present a CREW PRAM algorithm that runs in O(logn) parallel time and has linear work and space. This improves upon the best previous
Chung Keung Poon
exaly +2 more sources
A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model
Soft Computing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sumit Mishra +2 more
exaly +3 more sources
3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM
2008Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. We achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first.
Cheng-Ling Lee +2 more
exaly +3 more sources
Linear programming on the reconfigurable mesh and the CREW PRAM
, 1991 This thesis presents a new parallel algorithm for solving the linear programming problem in $R sp{d}$ for the reconfigurable mesh architecture and for the CREW PRAM model. The algorithm is based on the sequential technique discovered independently by Megiddo (Meg83, Meg84) and by Dyer (Dye84, Dye86), which gives a linear time algorithm, in n, the ...
We̜growicz, Paulina.
openaire +2 more sources