819 search results - page 101 / 164 » Parallelization with Tree Skeletons |
SPAA
1998
ACM
15 years 2 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
JSSPP
1995
Springer
15 years 1 months ago
1995
Springer
In this paper, we describe a new job scheduling class, called \Time Space Sharing Scheduling" (TSSS) for dynamically partitionable parallel machines. As an instance of TSSS, ...
PARELEC
2002
IEEE
15 years 2 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
SKG
2006
IEEE
15 years 3 months ago
2006
IEEE
Based on the Resource Space Model, this paper proposes a view mechanism for finding and reusing legacy Resource Spaces according to users’ idiosyncratic resource interests. It e...
SKG
2006
IEEE
15 years 3 months ago
2006
IEEE
Convolution kernels, such as tree kernel and subsequence kernel are useful for natural language processing tasks. However, most of them ignore the semantic knowledge. In order to ...