A.J. Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2):260-- 269. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Text Preprocessing for Speech Synthesis - Uwe Reichel Hartmut (Correct)
No context found.
A.J. Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2):260-- 269.
Improving Data Driven Part-of-Speech Tagging - Morphologic Knowledge Induction (Correct)
No context found.
Viterbi, A.J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2):260--269.
Efficient FPGA Implementations and Cryptanalysis of.. - Trinca (2006) (Correct)
No context found.
Viterbi, A.J.: Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Transactions on Information Theory IT-13(2):260--269, 1967.
Acoustic Lexemes for Organizing Internet Audio - Michael Casey Goldsmiths (Correct)
No context found.
Viterbi, A. J., "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, April 1967.
Maximum a Posteriori Sequence Estimation Using - Monte Carlo Particle (Correct)
No context found.
Viterbi, A. J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Info. Theory IT-13 260--269.
Microphone Array Processing for Robust Speech Recognition - Seltzer (2003) (Correct)
No context found.
Viterbi, A. J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13, 260--269.
An Internet-style Approach to Managing Wireless Link Errors - Eckhardt (2002) (1 citation) (Correct)
No context found.
Andrew J. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2), April 1967.
Efficient Algorithms for Speech Recognition - Ravishankar (1996) (35 citations) (Correct)
No context found.
Viterbi, A.J. Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. In IEEE Transactions on Information Theory, vol. IT-13, Apr. 1967, pp. 260-269.
Acoustic-Feature-Based Frequency Warping for Speaker Normalization - Gouvea (1998) (3 citations) (Correct)
No context found.
Viterbi, A., "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm", IEEE Transactions on Information Theory, v. IT-13, p. 260-269, 1967.
Tansen : A System For Automatic Raga Identification - Pandey, Mishra, Ipe (Correct)
No context found.
A. J. Viterbi: "Error bounds for convolutional codes and an asymptotically optimal decoding algorithm": IEEE Transactions on Information Theory, Volume IT-13, pp. 260-269: April 1967.
Boosting Word Error Rates - Dimitrakakis, Bengio (2004) (Correct)
No context found.
A. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, pages 260--269, 1967.
Likelihood-Mazimizing Beamforming for Robust Hands-Free.. - Seltzer, Raj, Stern (2004) (Correct)
No context found.
A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Transactions on Information Theory, vol. 13, no. 2, pp. 260--269, April 1967.
Sequential and Parallel Cascaded Convolutional Encryption with.. - Trinca (2006) (Correct)
No context found.
Viterbi, A.J.: Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Transactions on Information Theory IT-13(2), 260--269 (1967) 10
Merl -- A Mitsubishi Electric Research Laboratory - Http Www Merl (2003) (Correct)
No context found.
A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Transactions on Information Theory, vol. 13, pp. 260--269, Apr. 1967.
Constructing Free Energy Approximations and Generalized.. - Yedidia, Freeman, Weiss (2004) (15 citations) (Correct)
No context found.
A. J. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Info. Theory, 13(2):260--269, 1967.
Automatic 2D Hand Tracking in Video Sequences - Quan Yuan Stan (2005) (Correct)
No context found.
A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimal decoding algorithm, " IEEE T. Info. Theory, Vol. IT-13:260-269, 1967.
Boosting Word Error Rates - Dimitrakakis, Bengio (Correct)
No context found.
A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Transactions on Information Theory, pp. 260--269, 1967.
And Applications - Dissertation By Panayiotis (Correct)
No context found.
A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, no. 2, pp. 260--269, Apr. 1967.
Intentional Motion On-line Learning and Prediction - Vasquez (2005) (Correct)
No context found.
A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Transactions on Information Theory, vol. IT-13, no. 2, pp. 260--269, April 1967.
Graphical Models for Statistical Inference and Data.. - Ihler, Kirshner.. (2005) (Correct)
No context found.
A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. IT 13 (2) (1967) 260--269.
Steps Towards Safe Navigation in Open and Dynamic.. - Laugier, Petti.. (2005) (Correct)
No context found.
Andrew J. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13(2):260--269, April 1967.
Data Driven Number-of-States Selection in HMM Topologies - Knoblauch (2004) (Correct)
No context found.
A. J. Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," in IEEE Transactions on Information Theory, Beijing, China, 1967.
Learning Dynamic Bayesian Networks - Zoubin Ghahramani Department (1997) (39 citations) (Correct)
No context found.
A. J. Viterbi. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Trans. Informat. Theory, IT-13:260--269, 1967.
Use of Context in Automatic Annotation of Sports Videos - Kolonias, Christmas, Kittler (2004) (Correct)
No context found.
Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13 (1967) 260--269
Speech & Face Based Biometric Authentication at IDIAP - Sanderson (2003) (Correct)
No context found.
A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm", IEEE Trans. Information Theory, Vol. 13, No. 2, 1967, pp. 260-269.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC