12659 search results - page 273 / 2532 » The distributed breakout algorithms |
162
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
185
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
182
click to vote
ICPP
1987
IEEE
15 years 10 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
182
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
176
Voted
ICDCSW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we argue that there is a need for an event-based middleware to build large-scale distributed systems. Existing publish/subscribe systems still have limitations comp...