6105 search results - page 828 / 1221 » A Parallel Algorithm for Bound-Smoothing |
187
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
222
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
167
click to vote
ICCD
2002
IEEE
16 years 3 months ago
2002
IEEE
Subword parallelism has succeeded in accelerating many multimedia applications. Subword permutation instructions have been proposed to efficiently rearrange subwords in or among r...
177
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
— We propose a novel approach for sharing cluster resources among competing jobs. The key advantage of our approach over current solutions is that it increases cluster utilizatio...
215
Voted
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...