CS 530: Geometric and Probabilistic Methods in Computer Science *
Instructor: Lance Williams
Time: MWF 11:00 - 11:50 AM
Location: Woodward 149
Office Hours: Mon. 3:00-4:00, Tues. 3:00-4:00, Wed. 3:00-4:00.
Office: FEC 349C
Name: Todd Kaplan
Office Hours: Thurs. 9:00-11:00 AM, Fri. 9:00-11:00 AM
Office: FEC 355C
This is a course in applied mathematics for computer scientists, with
an emphasis on information theory and linear systems theory. The goal
of this course is to introduce computer science graduate students to
the practical kind of mathematics useful for computer simulation and
mathematical modeling and by researchers in scientific computation,
computer vision and graphics, image processing, robotics, machine
learning, and neural networks.
Course Syllabus **
- Week 1
- Week 2
- Week 3
- Week 4
- Week 5
- Week 6
- Week 7
- Week 8
- Week 9
- Week 10
- Week 11
- Week 12
- Week 13
- Week 14
- Week 15
- Week 16
This is not a linear algebra course. Knowledge of basic
linear algebra is a prerequisite! Concepts you should understand are:
vector sum and difference, inner product, matrix product, matrix
transpose, matrix inverse, linear independence, span, basis, rank,
orthogonality, change of basis, eigenvectors, and eigenvalues. There
will be an examination during the second meeting of the class on the
mathematics prerequisites. Students who do poorly on the prerequisite
examination should take Math 321.
There will be approximately six homework assignments. Many of the
homework problems will be similar to those you will find on the
midterms and final exams. Other problems will require experimentation
in MATLAB. All are designed to increase your understanding of the
fundamental ideas. Homeworks are to be turned in during class on the
day they are due. They should not be emailed to the professor.
- Schaum's Outline of Probability, Random Variables, and Random Processes (Hsu).
- Schaum's Outline of Linear Algebra (Lipschutz-Lipson).
- ven der Lubbe, J.C., Information Theory, Cambridge
Univ. Press, Cambridge, UK, 1997.
- Reza, F.M., Introduction to Information Theory, Dover
Publications, New York, NY, 1994.
- Lay, D.C., Linear Algebra and Its Applications (2nd Ed.),
- Strang, G., Linear Algebra and Its Applications (3rd Ed.),
Harcourt Brace Jovanovich, San Diego, CA, 1988.
- Roberts, M.J., Signals and Systems, McGraw Hill, New York, NY, 2004.
- Schaum's Outline of Signals and Systems (Hsu).
- Hubbard, B.B., The World According to Wavelets (2nd Ed.),
A.K. Peters, Wellesley, MA, 1998.
- Homeworks (approx. 6): 30%
- Midterm I: 18%
- Midterm II: 18%
- Final Exam: 34%
Class Mailing List
Most programming will be done in MATLAB or GNU Octave. Both have excellent
online documentation. Here are some useful routines:
Although experience shows them to be of little actual value, on all
exams, you are welcome to use a basic scientific calculator,
e.g., a TI-30. You will not be allowed to use graphing
calculators, programmable calculators, PDA's, or laptops. A good rule
of thumb is that if it cost you more than $20, you probably cannot use
it. If you have doubts, see me.
The final exam will be held during final exam week on the date
indicated in the university's final exam schedule.
* This page can be found at http://www.cs.unm.edu/~williams/cs530f04.html
** Subject to change.