1224 search results - page 67 / 245 » Design and Implementation of a Practical Parallel Delaunay A... |
141
click to vote
ISCOPE
1998
Springer
15 years 10 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
172
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
178
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
162
click to vote
ISCOPE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We discuss the parallelization and object-oriented implementation of Monte Carlo simulations for physical problems. We present a C++ Monte Carlo class library for the aut...
153
click to vote
DGCI
2006
Springer
15 years 9 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...