Sciweavers

199 search results - page 6 / 40
» Randomised Individual Communication Complexity
Sort
View
AAAI
2010
13 years 9 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
NETWORKING
2007
13 years 9 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 10 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
ICC
2008
IEEE
145views Communications» more  ICC 2008»
14 years 1 months ago
A Low-Complexity Synchronization Design for MB-OFDM Ultra-Wideband Systems
In this paper, we investigate the low-complexity synchronization design for multi-band orthogonalfrequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose...
Zhenzhen Ye, Chunjie Duan, Philip V. Orlik, Jinyun...
ICC
2009
IEEE
13 years 5 months ago
Opportunities, Constraints, and Benefits of Relaying in the Presence of Interference
In this paper the interference channel is extended by additional relay nodes in order to investigate the influence of interference on the design and performance of relaying protoco...
Peter Rost, Gerhard Fettweis, J. Nicholas Laneman