Results 31 to 40 of about 98,549 (74)
Parallel Minimum Cuts : An improved CREW PRAM algorithm
, 2020 This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96].
openaire +1 more source
Dictionary Compression on the PRAM
Parallel Processing Letters, 1997 D. Hirschberg, L. M. Stauffer
semanticscholar +1 more source
Parallel Merge Sort on Concurrent-Read Owner-Write PRAM
European Conference on Parallel Processing, 1997 D. C. Lin +2 more
semanticscholar +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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 +3 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.
Gupta Phalguni
exaly +3 more sources
3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM
International Conference on Algorithms and Architectures for Parallel Processing, 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.
Anu G Bourgeois +2 more
exaly +3 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
Optimal CREW-PRAM Algorithms for Direct Dominance Problems
Embedded Systems and Applications, 1993We present optimal parallel solutions to direct dominance problems for planar point sets. Our algorithms are deterministic and designed to run on the concurrent read exclusive write parallel random-access machine (CREW PRAM). In particular, we provide algorithms for counting the number of points that are directly dominated by each point of a planar ...
A. Datta +2 more
semanticscholar +2 more sources
A High Performance Parallel IP Lookup Technique Based on Multiprocessor Organization and CREW PRAM
2008 Second Asia International Conference on Modelling & Simulation (AMS), 2008The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traffic and migration to IPv6 addresses. The IP routing lookup involves computation of the Longest Prefix Matching for which existing solutions, such as BSD Radix Tries, scale poorly when traffic in the router increases or when employed for IPv6 ...
M. Hasanloo, A. Amiri, M. Fathy
semanticscholar +2 more sources