Sciweavers

1415 search results - page 89 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
PPAM
2005
Springer
15 years 8 months ago
Algorithms for Automatic Data Replication in Grid Environment
Abstract. Replication methods can be used for shortening the data access time in Grid environment with heterogeneous storage resources. In this paper we describe the algorithms for...
Renata Slota, Lukasz Skital, Darin Nikolow, Jacek ...
PPL
2008
124views more  PPL 2008»
15 years 2 months ago
Experimental Evaluation of BSP Programming Libraries
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
Peter Krusche
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 2 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...
MICCAI
2008
Springer
16 years 3 months ago
A Local Mutual Information Guided Denoising Technique and Its Application to Self-calibrated Partially Parallel Imaging
Abstract. The application of Partially Parallel Imaging (PPI) techniques to regular clinical Magnetic Resonance Imaging (MRI) studies has brought about the benefit of significantly...
Weihong Guo, Feng Huang
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 9 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng