Lecture on Markov Processes and Chains

Ajjen Joshi and Wenxin Feng

Syllabus for CS 537, Tuesday, Oct 22, 2013 lecture on Markov Processes:

1. Introduction (Definitions and Representations) of Markov Processes and Markov
Chains

2. Short mathematical exercise for students (5 - 10 minutes)

3. A randomized algorithm for 2-Satisfiability

4. Introduction and Applications of Hidden Markov Models (if we have time)

For parts 1-3, the reading assignment is pages 153-159 of our
textbook by Mitzenmacher and Upfal

For part 4, the reading assigment is pages 257-261 of the following
paper:

A Tutorial on Hidden Markov Models and Selected Applications in Speech
Recognition

http://www.cs.cornell.edu/Courses/cs4758/2012sp/materials/hmm_paper_rabiner.pdf