2924 search results - page 316 / 585 » Lower Bounds in Distributed Computing |
135
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
141
click to vote
CCECE
2009
IEEE
15 years 9 months ago
2009
IEEE
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the...
143
click to vote
ECCC
2011
14 years 11 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
145
click to vote
DCOSS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
151
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...