Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,728,820 papers from all fields of science
Search
Sign In
Create Free Account
Viterbi algorithm
Known as:
Viterbi path
, Vitterbi algorithm
, Viterbi search
Expand
The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
ARC (processor)
Algorithm
Baum–Welch algorithm
Bayesian programming
Expand
Broader (2)
Dynamic programming
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
A memory-efficient architecture for low latency Viterbi decoders
Yun-Ching Tang
,
Dosheng Hu
,
Weiyi Wei
,
Wen-Chung Lin
,
Hongchin Lin
International Symposium on VLSI Design…
2009
Corpus ID: 11046308
A memory-efficient Viterbi decoder (VD) named modified state exchange (MSE) is proposed using pre-trace back technique to obtain…
Expand
Highly Cited
2008
Highly Cited
2008
Better Alignments = Better Translations?
Kuzman Ganchev
,
João Graça
,
B. Taskar
Annual Meeting of the Association for…
2008
Corpus ID: 633088
Automatic word alignment is a key step in training statistical machine translation systems. Despite much recent work on word…
Expand
Highly Cited
2006
Highly Cited
2006
Automatic Synchronization between Lyrics and Music CD Recordings Based on Viterbi Alignment of Segregated Vocal Signals
Hiromasa Fujihara
,
Masataka Goto
,
J. Ogata
,
Kazunori Komatani
,
T. Ogata
,
Hiroshi G. Okuno
IEEE International Symposium on Multimedia
2006
Corpus ID: 17445483
This paper describes a system that can automatically synchronize between polyphonic musical audio signals and corresponding…
Expand
Highly Cited
2006
Highly Cited
2006
Support Vector Machines for continuous speech recognition
Jaume Padrell-Sendra
,
Darío Martín-Iglesias
,
F. Díaz-de-María
European Signal Processing Conference
2006
Corpus ID: 11082657
Although Support Vector Machines (SVMs) have been proved to be very powerful classifiers, they still have some problems which…
Expand
2003
2003
HMM-based channel error mitigation and its application to distributed speech recognition
A. Peinado
,
V. Sánchez
,
J. L. Pérez-Córdoba
,
Á. D. L. Torre
Speech Communication
2003
Corpus ID: 2833796
2001
2001
Forward error correction codes to reduce intercarrier interference in OFDM
K. Sathananthan
,
C. Tellambura
ISCAS . The IEEE International Symposium on…
2001
Corpus ID: 12552129
Orthogonal Frequency Division Multiplexing (OFDM) is sensitive to the carrier frequency offset (CFO), which destroys…
Expand
Highly Cited
1999
Highly Cited
1999
Iterative Posterior-Based Keyword Spotting Without Filler Models
M. Silaghi
,
H. Bourlard
1999
Corpus ID: 13948911
Keywords: speech Reference EPFL-CONF-82544 Record created on 2006-03-10, modified on 2017-05-12
Highly Cited
1993
Highly Cited
1993
Word spotting in scanned images using hidden Markov models
Francine R. Chen
,
L. Wilcox
,
D. Bloomberg
IEEE International Conference on Acoustics…
1993
Corpus ID: 57575108
A hidden-Markov-model (HMM)-based system for font-independent spotting of user-specified keywords in a scanned image is described…
Expand
Highly Cited
1993
Highly Cited
1993
Area-efficient architectures for the Viterbi algorithm. I. Theory
C. Shung
,
Horng-Dar Lin
,
R. Cypher
,
P. Siegel
,
H. Thapar
IEEE Transactions on Communications
1993
Corpus ID: 30679290
In the state-parallel implementation of the Viterbi algorithm, one add-compare-select (ACS) unit is devoted to each state in the…
Expand
1991
1991
Two extensions of the Viterbi algorithm
A. Bouloutas
,
G. Hart
,
M. Schwartz
IEEE Transactions on Information Theory
1991
Corpus ID: 29207980
The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE