6437 search results - page 295 / 1288 » Parallel Algorithms for Arrangements |
128
Voted
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
114
Voted
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factor...
131
Voted
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
We show in this paper how to evaluate the performance of skeleton-based high level parallel programs. Since many applications follow some commonly used algorithmic skeletons, we id...
149
Voted
AINA
2004
IEEE
15 years 7 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
124
Voted
AAAI
2010
15 years 5 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...