432 search results - page 13 / 87 » Internally deterministic parallel algorithms can be fast |
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
PARA
1994
Springer
15 years 1 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
100
Voted
PARELEC
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
ISBI
2006
IEEE
15 years 10 months ago
2006
IEEE
Parallel MR imaging is an effective approach to reduce MR image acquisition time. Non-uniform subsampling allows one to tailor the subsampling scheme for improved image quality at...
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
We address the problem of fast and accurate localization of miniature surgical instruments like needles or electrodes using 3D ultrasound (US). An algorithm based on maximizing a ...