Sciweavers

524 search results - page 65 / 105
» An Optimal Lower Bound on the Communication Complexity of Ga...
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
14 years 1 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
PODC
2009
ACM
14 years 8 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
VTC
2008
IEEE
14 years 2 months ago
High Rate Two-Way Amplify-and-Forward Half-Duplex Relaying with OSTBC
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...
Yang Han, See Ho Ting, Chin Keong Ho, Woon Hau Chi...
OPODIS
2007
13 years 9 months ago
Timed Quorum Systems for Large-Scale and Dynamic Environments
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
Vincent Gramoli, Michel Raynal