6437 search results - page 205 / 1288 » Parallel Algorithms for Arrangements |
105
click to vote
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
112
click to vote
STOC
1998
ACM
15 years 7 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
123
click to vote
HPCN
1997
Springer
15 years 6 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
136
click to vote
VLDB
1995
ACM
15 years 6 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
131
click to vote
PPL
2002
15 years 2 months ago
2002
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...