Professor Tse will be having office hours from 2:00-3:00 on TODAY and from 3:00-4:00 on Monday.
Final review will be held on May 13th (Thursday) 3-5pm in 241 Cory.
An easy-to-read and demo-enquipped tutorial on applying Viterbi algorithm in text recognition can be found here.
ROOM CHANGE for May 4 and May 6 classes. Classes will be held in 521 Cory (Hogan Room) at the usual time (9:30-11:00).
Links for the examples on speech recognition from EE20 are here: Voder, Vocoder
The statistics of the second midterm is here.
A FREE software to create PDF file from WORD etc is provided via this link.
Office hours: TTh 3:00-4:00
Teaching Assistant: Minghua Chen, (minghua@eecs.berkeley.edu), Room: 493 Cory; Office hours: M 3-4pm, Tu/W 4-5pm
Reader: Walter Carlos Richter (wrichter@eecs.berkeley.edu)
Administrative Assistant: Chris Colbert, Room 231 Cory Hall, 642-8458, chrisc@eecs.berkeley.edu
Course web site: http://inst.EECS.Berkeley.EDU/~ee126
Lectures: T-Th, 9:30-11:00 in 160 Kroeber.
Discussions: W 5:00-6:00 in 285 Cory; Th 8:00-9:00a.m. in 9 Lewis
This course covers the fundamentals of the tools of probabilistic modeling useful in a diverse range of EECS fields, such as networks, communication, signal processing, and control.
Prerequisite:
Basic knowledge of calculus and exposure to mathematical concepts such as sets, functions, etc.
Evaluation:
There will be weekly problem sets (20% of the course grade), two midterms (20% each), and a final exam (40% of grade). The first midterm will be in class on 26 February.
Texts:
Supplemental reading on reserve in the Engineering Library:
Practice midterms for midterm 1: Spring 98, Spring 99, Fall 99 Fall 98(solution)
Practice midterms for midterm 2: Fall 97, Fall 98 F98 Midterm 2 Solutions, Fall 99 F99 Midterm 2 Solutions, Fall 2002
Practice final: Fall 99 Review, Fall 99(problem 3 not required)
Fall '01 practice final: Final – Fall 2001 Solutions
Spring '99 practice final: Final – Spring 1999 No solutions
Homework #3 Solution (Code to generate problem 6's plots using mathemetica, which can deal with {200 \choose k}, thanks Jonathan for providing the code)
Homework #7 - REVISED Solution
Homework #9 Solution (revised)
Revised Homework #10 Solution (revised)
Homework #11 Solution (revised)
Week #3 Solutions: version 1 (by Sagnik and Harriet) version 2 (by Maryam)
Week #4 (revised 02/13/04) Solutions: version 1 part a part b(by Quan)
Week #11 Solutions: version 1 (by Bryan Lin and Haidang) version 2 (by Andre Tjokro)
Week #12 Solutions: version 1 part A (by Christine and ) version 2 (by Sammy)
Week #13 Solutions: version 1 (by Valerie and Alan) version 2 (by Sara) Version 3A B (by Chris)
Week #14 Solutions: version 1 (by William and Robert) version 2 (by Jansen)
Week #15Solutions: version 1 (by Ted) version 2 (by Yong Da (Paul))
Week #16 Solutions: version 1 (by Richard) version 2 (by Liliya)