Sciweavers

2924 search results - page 393 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 11 months ago
Alternative Symbol Representations with Radial Symmetry for PAPR Reduction in OFDM Systems
— This paper proposes a new method for peak to average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems using two alternative signalling ...
Ali Al-Shaikhi, Jacek Ilow
IEEEPACT
2007
IEEE
15 years 11 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
ICPADS
2006
IEEE
15 years 11 months ago
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson
161
Voted
NSDI
2010
15 years 6 months ago
Airavat: Security and Privacy for MapReduce
We present Airavat, a MapReduce-based system which provides strong security and privacy guarantees for distributed computations on sensitive data. Airavat is a novel integration o...
Indrajit Roy, Srinath T. V. Setty, Ann Kilzer, Vit...
STACS
2007
Springer
15 years 11 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis