Sciweavers

5793 search results - page 103 / 1159
» Individual communication complexity
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
On the Market Power of Network Coding in P2P Content Distribution Systems
Abstract—Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture in peers, it simpli...
Xinyu Zhang, Baochun Li
INFOCOM
2005
IEEE
15 years 10 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown
GLOBECOM
2008
IEEE
15 years 5 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
163
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
Time-Varying Channel Complex Gains Estimation and ICI Suppression in OFDM Systems
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
Hussein Hijazi, Laurent Ros
EUROCODE
1990
15 years 9 months ago
Linear complexity of transformed sequences
: This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity,...
Harriet J. Fell