Sciweavers

28 search results - page 5 / 6
» An asymptotic Lower Bound for the Maximal Number of Runs in ...
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 7 months ago
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
Masoud Ebrahimi, Amir K. Khandani
SPAA
2005
ACM
14 years 1 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
GLOBECOM
2008
IEEE
14 years 1 months ago
Interference Reduction by Beamforming in Cognitive Networks
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
Simon Yiu, Mai Vu, Vahid Tarokh
TIT
2010
94views Education» more  TIT 2010»
13 years 2 months ago
Rewriting codes for joint information storage in flash memories
Abstract--Memories whose storage cells transit irreversibly between states have been common since the start of the data storage technology. In recent years, flash memories have bec...
Anxiao Jiang, Vasken Bohossian, Jehoshua Bruck
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 19 days ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler