CS 598

Fall 2008 All Classes

All Classes

Special Topics

Course in Catalog

List of Terms offered

Credit: 2 TO 4 hours.

Lecture course in topics of current interest. See Schedule for current topics.

May be repeated. Prerequisite: As specified for each topic offering, see Schedule or departmental course description.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 598 class schedule data for fall 2008
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
42377	Lecture-Discussion	CAG	11:00AM -12:15PM	TR	1131 Siebel Center for Comp Sci	Gunter, C	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topic: Advanced Computer Security. Prerequisite: a 400 level course in security or consent of instructor. Research projects in security in the areas of monitoring and surveillance, critical infrastructure protection, unwanted traffic on the Internet, secure web services, tamper-resistant security architectures.
46983	Lecture-Discussion	DAF	12:30PM -1:45PM	WF	1131 Siebel Center for Comp Sci	Forsyth, D	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topic: Optimization in computer vision and machine learning. We will discuss applications of current optimization methods to problems in computer vision and machine learning.
49222	Lecture-Discussion	GA	2:00PM -3:15PM	WF	ARR Siebel Center for Comp Sci	Agha, G	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topic: Actor Programming Languages and Systems The growth of multicore computers, P2P systems, sensor networks and other large-scale parallel systems has renewed popular interest in actor programming. Actor oriented programming languages and frameworks currently in use include Charm++, Erlang, E, Scala, SALSA, Revactor, Ptolemy, and Newspeak. The course will cover actor language design; actor implementations on multicore computers, distributed systems, and networked embedded systems; and applications to multi-agent, pervasive and ubiquitous computing.
42393	Lecture-Discussion	MCC	9:30AM -10:45AM	TR	1302 Siebel Center for Comp Sci	Caesar, M	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topic: Advanced Internetworking. The Internet is an astounding engineering triumph, comprising tens of thousands of competing ISPs, hundreds of millions of end hosts, and a complex intertwining of systems and protocols to form the largest distributed system ever created. In this course you will gain an understanding of how the Internet works, how to use tools commonly used for network measurement and research, and learn the state-of-the-art in computer networking research at the IP layer and above. Students will perform a research project, with the goal to submit their results for publication in a conference. While completion of an undergraduate networking class is helpful, it is not required, and students from all systems-related areas are encouraged to participate.
49196	Lecture-Discussion	RHC	2:00PM -3:15PM	TR	1131 Siebel Center for Comp Sci	Campbell, R	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topic: Ubiquitous Systems. Ubiquitous and pervasive computing is a new and exciting platform and paradigm for anywhere, anyhow services and information systems. This new research area is a natural outcome of the tremendous advances in wireless networks, mobile computing, sensor networks, distributed computing, and agent technologies. This advanced graduate course is project and reading based and explores issues of applications, privacy, infrastructure, mobile, wireless, and distributed computing in an Internet environment with advanced human-computer interfaces, high-definition multimedia, and powerful, efficient computing. As prerequisites, the students should have basic knowledge of systems and networking, security, and system design.
40105	Lecture-Discussion	SHP	11:00AM -12:15PM	TR	ARR Siebel Center for Comp Sci	Har-Peled, S	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topic: Randomized Algorithms. The last two decades have witnessed a tremendous growth in the area of randomized algorithms. During this period, randomized algorithms went from being a tool in computational number theory to finding widespread application in many types of algorithms. Two benefits of randomization have spearheaded this growth: simplicity and speed. This course presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. The aim is to touch upon various branches of the study of randomized algorithms. In the end of this course, one should be able to design and/or analyze a randomized algorithm for your favorite problem. For topics covered, see class notes from previous semester: http://valis.cs.uiuc.edu/~sariel/teach/notes/rand_alg/notes.pdf
36004	Lecture-Discussion	WG	2:00PM -3:15PM	WF	1131 Siebel Center for Comp Sci	Gropp, W	Part of Term: 1 Date Range: 08/25/08-12/10/08 Credit: 4 hours Section Info: Topics in High Performance Computing: Architecture, Algorithms, and Programming Models An exploration of the relationships between algorithms, programming models, and computer architecture for high performance computing. Topics include the impact of modern architectural features on the complexity models used to inspire and evaluate algorithms, the impact of memory hierarchy and other features on both node performance and scalability, and the support for scalable and efficient code in programming models.