Sciweavers

13414 search results - page 376 / 2683
» The distributed boosting algorithm
Sort
View
PDP
2010
IEEE
16 years 1 months ago
Skandium: Multi-core Programming with Algorithmic Skeletons
—This paper argues that algorithmic skeletons are a suitable programming model for multi-core architectures. -level abstractions offered by algorithmic skeletons provide a simple...
Mario Leyton, José M. Piquer
IPPS
2003
IEEE
16 years 2 days ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
PDP
2003
IEEE
16 years 2 days 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...
CLADE
2003
IEEE
16 years 3 days 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,...
IPPS
1997
IEEE
15 years 11 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...