6105 search results - page 427 / 1221 » A Parallel Algorithm for Bound-Smoothing |
173
Voted
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
186
click to vote
IPPS
2003
IEEE
16 years 4 days ago
2003
IEEE
String comparison is a critical issue in many application domains, including speech recognition, contents search, and bioinformatics. The similarity between two strings of lengths...
172
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
146
click to vote
MOC
2000
15 years 6 months ago
2000
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
168
Voted
CAV
2009
Springer
16 years 7 months ago
2009
Springer
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...