This class is a graduate-level introduction to Natural Language Processing (NLP), the study of computing systems that can process, understand, or communicate in human language. The course covers ...

When emailing us, please put CS395 in the subject line. Topics: This is a graduate seminar course in computer vision. We will survey and discuss current vision papers relating to object recognition, ...

You need to have downloaded and installed BlueJ before completing the following steps. Download the java files you need from the class web site. You don't have to put ...

Sumaya M Al-Bedaiwi, salbedaiwi@utexas.edu, Office hours: Mon 12:30 PM - 1:30 PM, Wed 3:30 PM - 4:30 PM in the GDC Basement.

Our students and faculty are changing the world through their contributions to computing education, research, and industry. These awards received by members of the UT Computer Science community make ...

Computer ethics as a field of study was founded by MIT professor Norbert Wiener during World War Two (early 1940s) while helping to develop an antiaircraft cannon capable of shooting down fast ...

This is a section from the last essay written by Isaiah Berlin, published in the New York Review of Books, Vol. XLV, Number 8 (1998). Copyright: The Isaiah Berlin ...

Do you have a navigation system for mobile robots that you're interested in benchmarking against other approaches? Are you interested in precisely characterizing which types of environments it can ...

We are an interdisciplinary group of active researchers in data/web mining and associated subjects. Areas of expertise include: machine learning, adaptive pattern recognition, scalable and distributed ...

When emailing me, please put CS395 in the subject line. Topics: This is a graduate seminar course in computer vision. We will survey and discuss current vision papers relating to object recognition, ...

We know that there are n! permutations of n elements; we have seen this fact when e.g. proving lower bounds on comparison sorting and the brute-force algorithm for solving the Travelling Salesman ...