1503 search results - page 233 / 301 » Self-optimizing distributed trees |
114
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
216
Voted
ARTS
1999
Springer
15 years 7 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
128
click to vote
IWCC
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-le...
166
Voted
HIPC
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
118
Voted
SPAA
1998
ACM
15 years 7 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...