Results 121 to 130 of about 3,574 (177)
Identifying Medical Concepts and Semantic Types in Lay Vocabularies of Health Consumers Who are Concerned with Diabetes on Social Media Using the UMLS and NLP. [PDF]
Proc COMPSACAnik AA +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the IEEE, 1973
The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discrete-time finite-state Markov process observed in memoryless noise. Many problems in areas such as digital communications can be cast in this form.
G D Forney
exaly +2 more sources
The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discrete-time finite-state Markov process observed in memoryless noise. Many problems in areas such as digital communications can be cast in this form.
G D Forney
exaly +2 more sources
On the Viterbi decoding algorithm
IEEE Transactions on Information Theory, 1969A new interpretation of the Viterbi decoding algorithm based on the state-space approach to dyamical systems is presented. In this interpretation the optimum decoder solves a generalized regulator control problem by dynamic programming techniques.
J Omura
exaly +2 more sources
A personal history of the Viterbi algorithm
IEEE Signal Processing Magazine, 2006This paper describes how Andrew J. Viterbi developed a non-sequential decoding algorithm which proved useful in showing the superiority of convolutional codes over block codes for a given degree of decoding complexity. The Viterbi algorithm is now used in most digital cellular phones and digital satellite receivers as well as in such diverse fields as ...
A J Viterbi
exaly +2 more sources
The Viterbi algorithm for sparse channels
IEEE Transactions on Communications, 1996This paper presents a reduced complexity Viterbi algorithm for use as sequence estimator for linear intersymbol interference channels with coarsely located coefficients. In particular, the complexity does not depend on the channel impulse response length but only on the number of nonzero coefficients. No approximations are used in the algorithm.
R Marchesani
exaly +3 more sources
Implementing the Viterbi algorithm
IEEE Signal Processing Magazine, 1995The Viterbi algorithm, an application of dynamic programming, is widely used for estimation and detection problems in digital communications and signal processing. It is used to detect signals in communication channels with memory, and to decode sequential error-control codes that are used to enhance the performance of digital communication systems ...
exaly +2 more sources
Deformed template matching by the Viterbi algorithm
Pattern Recognition Letters, 1996Abstract We consider a template matching algorithm that aims to deform a given template and place it onto a target-image to match as many edges as possible. To simplify this optimization problem, we will introduce a particular class of deformations that makes the Viterbi Algorithm applicative.
exaly +2 more sources
Robustifying the Viterbi Algorithm
2014We present an efficient algorithm for estimating hidden state sequences in imprecise hidden Markov models (iHMMs), based on observed output sequences. The main difference with classical HMMs is that the local models of an iHMM are not represented by a single mass function, but rather by a set of mass functions.
Cedric De Boom +3 more
openaire +1 more source
Generalisation of the Viterbi algorithm
IMA Journal of Management Mathematics, 1992Summary: The Viterbi algorithm, derived using dynamic programming techniques, is a maximum a posteriori (MAP) decoding method which was developed in the electrical engineering literature to be used in the analysis of hidden Markov models (HMMs). Given a particular HMM, the original algorithm recovers the MAP state sequence underlying any observation ...
openaire +2 more sources