Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Iterative_Viterbi_decoding> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items 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 wikiPageRevisionID "309157744".
- 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 type Assistant109815790.
- Iterative_Viterbi_decoding type CausalAgent100007347.
- Iterative_Viterbi_decoding type LivingThing100004258.
- Iterative_Viterbi_decoding type MarkovModels.
- Iterative_Viterbi_decoding type Model110324560.
- Iterative_Viterbi_decoding type Object100002684.
- Iterative_Viterbi_decoding type Organism100004475.
- Iterative_Viterbi_decoding type Person100007846.
- Iterative_Viterbi_decoding type PhysicalEntity100001930.
- Iterative_Viterbi_decoding type Whole100003553.
- Iterative_Viterbi_decoding type Worker109632518.
- Iterative_Viterbi_decoding type YagoLegalActor.
- Iterative_Viterbi_decoding type YagoLegalActorGeo.
- 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 sameAs Iterative_Viterbi_decoding.
- Iterative_Viterbi_decoding wasDerivedFrom Iterative_Viterbi_decoding?oldid=309157744.
- Iterative_Viterbi_decoding isPrimaryTopicOf Iterative_Viterbi_decoding.