MWF 1320 DCL, 09h00-09h50
TA's: Saurabh Singh (firstname.lastname@example.org) and Daphne Tsatsoulis (email@example.com)
DAF: Monday, 10h00-11h00, Wednesday, 10h00-11h00, Friday, 10h00-11h00 (3310 Siebel)
Saurabh: Monday 14h30-15h30, Wednesday 14h30-15h30 (Siebel Center downstairs TA office for 400 level classes)
Daphne: Monday, 13h00-15h00, Friday, 14h00-15h00 (Siebel Center downstairs TA office for 400 level classes) NOTE NEW HOURS!
or swing by my office (3310 Siebel) and see if I'm busy
Evaluation is by: Homeworks, Midterm, take home final.
I will shortly post a policy on collaboration and plagiarism
Read the textbook. I wrote it specifically for this course, AND it's free. I will split time in lecture between sketching important points described in the text, and solving problems. If you haven't read the text, this might be quite puzzling.
Probability and Statistics for Computer Scientists, D.A. Forsyth, (approximate 9'th draft)
some slides on nearest neighbors and texture
(or at least, a record of what I have lectured and prospective information about what I shall lecture)
|2||Ch2 finish, Ch4|
|4||Ch4 finish, Ch5|
|5||Ch5, start Ch6|
|6||Ch 6, to finish; Ch 7|
|7||Ch 8 (skipping sampling methods and MTG-DAF); start Ch 9|
|8||Ch 9 ; midterm|
|9||Ch9 , Ch10|