Sciweavers

824 search results - page 60 / 165
» Weighted Low-Rank Approximations
Sort
View
131
Voted
ICASSP
2010
IEEE
15 years 4 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
JGAA
2006
63views more  JGAA 2006»
15 years 3 months ago
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
Reuven Bar-Yehuda, Irad Yavneh
TSP
2010
14 years 10 months ago
A recursive method for the approximation of LTI systems using subband processing
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Damián Marelli, Minyue Fu
STACS
2004
Springer
15 years 9 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
ICML
2007
IEEE
16 years 4 months ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor