Sciweavers

1523 search results - page 227 / 305
» The Computational Complexity of Linear Optics
Sort
View
PODC
2009
ACM
14 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
ICC
2009
IEEE
151views Communications» more  ICC 2009»
14 years 4 months ago
Slow Adaptive OFDMA via Stochastic Programming
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...
Wei Liang (William) Li, Ying Jun (Angela) Zhang, M...
IPPS
2007
IEEE
14 years 4 months ago
File Creation Strategies in a Distributed Metadata File System
As computing breaches petascale limits both in processor performance and storage capacity, the only way that current and future gains in performance can be achieved is by increasi...
Ananth Devulapalli, Pete Wyckoff
TAMC
2007
Springer
14 years 3 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
VTC
2010
IEEE
122views Communications» more  VTC 2010»
13 years 8 months ago
Generalized MIMO Transmit Preprocessing Using Pilot Symbol Assisted Rateless Codes
In this paper, we propose a generalized multiple-input multiple-output (MIMO) transmit preprocessing system, where both the channel coding and the linear MIMO transmit precoding c...
Nicholas Bonello, Du Yang, Shen Chen, Lajos Hanzo