2956 search results - page 142 / 592 » Efficient Communication by Breathing |
144
click to vote
PKC
2010
Springer
15 years 8 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
148
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
161
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
194
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
163
click to vote
SOSP
2001
ACM
16 years 3 months ago
2001
ACM
In most distributed systems, naming of nodes for low-level communication leveragestopologicallocation(such as node addresses) and is independentof any application. In this paper, ...