CS 598

Spring 2011 All Classes

All Classes

Special Topics

Credit: 2 TO 4 hours.

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites.

May be repeated in the same or separate terms if topics vary.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 598 class schedule data for spring 2011
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
50226	Lecture-Discussion	CSC	11:00AM -12:15PM	WF	1105 Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 01/18/11-05/04/11 Credit: 4 hours Section Info: Topics: Approximation Algorithms. Approximation algorithms for NP-hard problems are polynomial time heuristics that have provable guarantees on the quality of their solutions. This course will provide a broad introduction to results and techniques in this area. Emphasis will be on fundamental problems and techniques that are of wide applicability. In particular, this terms class will focus mostly on linear and semi-definite programming methods for graph problems.
39668	Lecture-Discussion	DAF	11:00AM -12:15PM	WF	1131 Siebel Center for Comp Sci	Forsyth, D	Part of Term: 1 Date Range: 01/18/11-05/04/11 Credit: 4 hours Section Info: Topic: Applied Optimization Methods. We will describe current optimization methods for continuous and discrete problems, with a particular emphasis on applications. We will discuss methods used in computer vision, machine learning, natural language understanding and other application areas.
43808	Lecture-Discussion	JGE	12:30PM -1:45PM	TR	203 Transportation Building	Erickson, J	Part of Term: 1 Date Range: 01/18/11-05/04/11 Credit: 4 hours Section Info: Topic: Advanced Data Structures. This course will survey important developments in data structures that have not (yet) worked their way into the standard computer science curriculum. Potential topics include include self-adjusting binary trees, dynamic trees and graphs, persistent (multiversion) data structures, kinetic data structures, I/O-efficient and cache-oblivious data structures, hash tables and Bloom filters, distributed load balancing strategies, how to information-theoretic lower bounds, and applications of these structures in combinatorial optimization, computational geometry, systems and networking, databases, and other areas of computer science. Prerequisite: CS 573.
46428	Lecture-Discussion	LRS	2:00PM -3:15PM	TR	1131 Siebel Center for Comp Sci	Sha, L	Part of Term: 1 Date Range: 01/18/11-05/04/11 Credit: 4 hours Section Info: Topic: Cyber Physical Systems. The convergence of computing and networking gives us the Internet, and the coming convergence of the Cyber world and the sensing and control of physical environment gives us CPS. The President's Council of Advisors on Science and Technology has placed CPS on the top of the priority list for federal research investment, so are EU. This class will introduce you to the technologies to address the key challenge of achieving simplicity, safety and effectiveness when we composing CPS systems using components with different degree of reliability. In addition to lectures, there is a hands-on project. This year's project is on the topic of safe medical device composition. To learn more about this challenge, see http://mdpnp.org/uploads/Capitol_Hill_NSF_CPS_MD_PnP_9July09.pdf . This class admits both senior undergrads and graduate students.
54549	Lecture-Discussion	MCC	11:00AM -12:15PM	TR	1304 Siebel Center for Comp Sci	Caesar, M	Part of Term: 1 Date Range: 01/18/11-05/04/11 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 ISPs are built and maintained, network security, interdomain routing protocols, how to use tools commonly used for network measurement and research, and learn the state-of-the-art in Internet-related research. 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 recommended, it is not required, and students from all systems-related areas are encouraged to participate.
31665	Lecture-Discussion	REJ	3:00PM -4:45PM	TR	1304 Siebel Center for Comp Sci	Johnson, R	Part of Term: 1 Date Range: 01/18/11-05/04/11 Credit: 4 hours Section Info: Topic: Object-Oriented Programming and Design. Learn object-oriented design by studying examples from Squeak, many of which have been polished for 25 years. Learn about design patterns, how to use frameworks and how to design them, and reflection. Prerequisite: Graduate standing or Consent of Instructor.