Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Iterative_Viterbi_decoding> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Iterative_Viterbi_decoding abstract "Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability (i.e., probability scaled by the length of S) of being generated by a given hidden Markov model M with m states. The algorithm uses a modified Viterbi algorithm as an internal step.The scaled probability measure was first proposed by John S. Bridle. An early algorithm to solve this problem, sliding window, was proposed by Jay G. Wilpon et al., 1989, with constant cost T = mn2/2.A faster algorithm consists of an iteration of calls to the Viterbi algorithm, reestimating a filler score until convergence.".
- Iterative_Viterbi_decoding wikiPageID "1232914".
- Iterative_Viterbi_decoding wikiPageLength "2361".
- Iterative_Viterbi_decoding wikiPageOutDegree "10".
- Iterative_Viterbi_decoding wikiPageRevisionID "309157744".
- Iterative_Viterbi_decoding wikiPageWikiLink Algorithm.
- Iterative_Viterbi_decoding wikiPageWikiLink Category:Error_detection_and_correction.
- Iterative_Viterbi_decoding wikiPageWikiLink Category:Markov_models.
- Iterative_Viterbi_decoding wikiPageWikiLink Distance_matrix.
- Iterative_Viterbi_decoding wikiPageWikiLink Hidden_Markov_model.
- Iterative_Viterbi_decoding wikiPageWikiLink Jay_G._Wilpon.
- Iterative_Viterbi_decoding wikiPageWikiLink John_S._Bridle.
- Iterative_Viterbi_decoding wikiPageWikiLink Sliding_window.
- Iterative_Viterbi_decoding wikiPageWikiLink Sliding_window_protocol.
- Iterative_Viterbi_decoding wikiPageWikiLink Viterbi_algorithm.
- Iterative_Viterbi_decoding wikiPageWikiLinkText "Iterative Viterbi decoding".
- Iterative_Viterbi_decoding wikiPageWikiLinkText "iterative Viterbi decoding".
- Iterative_Viterbi_decoding wikiPageWikiLinkText "iterative decoding".
- Iterative_Viterbi_decoding hasPhotoCollection Iterative_Viterbi_decoding.
- Iterative_Viterbi_decoding subject Category:Error_detection_and_correction.
- Iterative_Viterbi_decoding subject Category:Markov_models.
- Iterative_Viterbi_decoding hypernym Algorithm.
- Iterative_Viterbi_decoding type Model.
- Iterative_Viterbi_decoding type Software.
- Iterative_Viterbi_decoding type Algorithm.
- Iterative_Viterbi_decoding type Model.
- Iterative_Viterbi_decoding type Protocol.
- Iterative_Viterbi_decoding comment "Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability (i.e., probability scaled by the length of S) of being generated by a given hidden Markov model M with m states. The algorithm uses a modified Viterbi algorithm as an internal step.The scaled probability measure was first proposed by John S. Bridle. An early algorithm to solve this problem, sliding window, was proposed by Jay G.".
- Iterative_Viterbi_decoding label "Iterative Viterbi decoding".
- Iterative_Viterbi_decoding sameAs m.04kn96.
- Iterative_Viterbi_decoding sameAs Q6094410.
- Iterative_Viterbi_decoding sameAs Q6094410.
- Iterative_Viterbi_decoding wasDerivedFrom Iterative_Viterbi_decoding?oldid=309157744.
- Iterative_Viterbi_decoding isPrimaryTopicOf Iterative_Viterbi_decoding.