Skip to search formSkip to main contentSkip to account menu

Markov model

Known as: Hierarchical Markov model, Markov models 
In probability theory, a Markov model is a stochastic model used to model randomly changing systems where it is assumed that future states depend… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Alignment-free sequence analysisAncestral graphAsymmetric Numeral SystemsAugmented transition network

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Publication IV
A large sample of vowels produced by male and female speakers were inverse filtered and parameterized using 21 different glottal… 
2006
2006
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for… 
2002
2002
Comparative Study of Approaches to Estimate Pipe Break Frequencies
The report describes the comparative study of two approaches to estimate pipe leak and rupture frequencies for piping. One method… 
2001
2001
Markov face models
The spatial distribution of gray level intensities in an image can be naturally modeled using Markov random field (MRF) models… 
1999
1999
Semi-Markov Models: Theory and Applications
Section I. Markov Additive Processes and Regenerative Systems.- Some limit theorems for Markov additive processes.- Stationary… 
1999
1999
Theoretical and Technical Orientations toward Longitudinal Research in the Social Sciences
Highly Cited
1995
Highly Cited
1995
The Codesign of Embedded Systems: A Unified Hardware/Software Representation
Current practice dictates the separation of the hardware and software development paths early in the design cycle. These paths… 
1995
1995
A Predictive Mobility Management Scheme for Supporting Wireless Mobile Computing
This report describes a novel predictive mobility management algorithm for supporting global mobile data accessing. Traditionally… 
1978
1978
Fixed-rate universal codes for Markov sources
The existence of a fixed-rate block source code whose performance for each source in a class of Markov sources is uniformly close… 
1971
1971
Information rates of stationary ergodic finite-alphabet sources
The generalized Shannon lower bound to the rate-distortion function R(D) for stationary sources with memory is extended to a wide… 
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)