Sciweavers

336 search results - page 60 / 68
» Memories of bug fixes
Sort
View
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
IDA
2002
Springer
13 years 7 months ago
Online classification of nonstationary data streams
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
Mark Last
CJ
2010
87views more  CJ 2010»
13 years 5 months ago
Resource-Aware Multimedia Content Delivery: A Gambling Approach
In this paper, we propose a resource-aware solution to achieving reliable and scalable stream diffusion in a probabilistic model, i.e., where communication links and processes are...
Mouna Allani, Benoît Garbinato, Fernando Ped...
GLOBECOM
2010
IEEE
13 years 5 months ago
Reinforcement Learning for Link Adaptation in MIMO-OFDM Wireless Systems
Machine learning algorithms have recently attracted much interest for effective link adaptation due to their flexibility and ability to capture more environmental effects implicitl...
Sungho Yun, Constantine Caramanis
TVLSI
2010
13 years 2 months ago
Enhancing the Area Efficiency of FPGAs With Hard Circuits Using Shadow Clusters
There is a dramatic logic density gap between FPGAs and ASICs, and this gap is the main reason FPGAs are not cost-effective in high volume applications. Modern FPGAs narrow this ga...
Peter A. Jamieson, Jonathan Rose