Sciweavers

92 search results - page 11 / 19
» From maximum likelihood to iterative decoding
Sort
View
TNN
1998
114views more  TNN 1998»
13 years 7 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
ICASSP
2011
IEEE
12 years 11 months ago
Joint source-filter modeling using flexible basis functions
Improving on recent work on joint source-filter analysis of speech waveforms, we explore improvements to an autoregressive model with exogenous inputs represented by flexible ba...
Daryush D. Mehta, Daniel Rudoy, Patrick J. Wolfe
ICASSP
2010
IEEE
13 years 7 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
CORR
2006
Springer
81views Education» more  CORR 2006»
13 years 7 months ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright
SCIA
2005
Springer
182views Image Analysis» more  SCIA 2005»
14 years 1 months ago
Complex Correlation Statistic for Dense Stereoscopic Matching
A traditional solution of area-based stereo uses some kind of windowed pixel intensity correlation. This approach suffers from discretization artifacts which corrupt the correlat...
Jan Cech, Radim Sára