Sciweavers

17770 search results - page 249 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
193
Voted
JSAC
2010
180views more  JSAC 2010»
15 years 1 months ago
List Decoding Techniques for Intersymbol Interference Channels Using Ordered Statistics
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results f...
Fabian Lim, Aleksandar Kavcic, Marc P. C. Fossorie...
DAM
2008
84views more  DAM 2008»
15 years 7 months ago
The colourful feasibility problem
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
Antoine Deza, Sui Huang, Tamon Stephen, Tamá...
ICASSP
2010
IEEE
15 years 7 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
SIAMJO
2010
125views more  SIAMJO 2010»
15 years 1 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
SYNASC
2008
IEEE
266views Algorithms» more  SYNASC 2008»
16 years 1 months ago
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. This enables us to compute data dependences in more ge...
Armin Größlinger, Stefan Schuster