337 search results - page 29 / 68 » Computational complexity of weighted splitting schemes on pa... |
PARA
1995
Springer
13 years 11 months ago
1995
Springer
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS . The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
TOG
2008
13 years 7 months ago
2008
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...