2924 search results - page 542 / 585 » Lower Bounds in Distributed Computing |
RELMICS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
ICSOC
2004
Springer
14 years 1 months ago
2004
Springer
Emerging Web services standards enable the development of large-scale applications in open environments. In particular, they enable services to be dynamically bound. However, curr...
ICT
2004
Springer
14 years 1 months ago
2004
Springer
Array antennas have the potential to increase the capacity of wireless networks, but a distributed beamforming algorithm for maximizing the capacity in asynchronous, decentralized ...
ISPA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...