Sciweavers

6129 search results - page 237 / 1226
» A parallel LLL algorithm
Sort
View
PDP
2003
IEEE
15 years 7 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...
114
Voted
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
15 years 6 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
SPAA
2009
ACM
16 years 2 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 7 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
CLADE
2003
IEEE
15 years 7 months ago
Issues in Runtime Algorithm Selection for Grid Environments
The heterogeneity and unpredictability of grid computing environments is a severe challenge to algorithm selection for large-scale scientific codes. This paper discusses a set of ...
Prachi Bora, Calvin J. Ribbens, Sandeep Prabhakar,...