2924 search results - page 185 / 585 » Lower Bounds in Distributed Computing |
120
click to vote
SKG
2006
IEEE
15 years 9 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
127
Voted
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speed-up with the number of computing nodes. The algorithm is the fi...
147
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
133
click to vote
ADHOC
2007
15 years 3 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
137
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...