6542 search results - page 178 / 1309 » The tao of parallelism in algorithms |
134
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
169
click to vote
ICPP
2005
IEEE
16 years 5 days ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
165
click to vote
SAC
2004
ACM
16 years 59 min ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
190
click to vote
JASIS
2007
15 years 6 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
181
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...