CS 498

Fall 2010 All Classes

All Classes

Special Topics

Credit: 0 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 498 class schedule data for fall 2010
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
55964	Lecture	DH3	11:00AM -12:15PM	TR	1103 Siebel Center for Comp Sci	Hoiem, D	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 3 hours Section Info: Topic: Computational Photography. This course explores how to use computer vision techniques to enhance, manipulate, and create media from photo collections. Topics will include photo stitching, face morphing, texture synthesis, recoloring, and 3D reconstruction. This projects-based course is intended for advanced undergraduates; some programming ability and knowledge of linear algebra will be assumed. This section is for either undergraduate or graduate students.
55965	Lecture	DH4	11:00AM -12:15PM	TR	1103 Siebel Center for Comp Sci	Hoiem, D	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 4 hours Section Info: Topic: Computational Photography. This course explores how to use computer vision techniques to enhance, manipulate, and create media from photo collections. Topics will include photo stitching, face morphing, texture synthesis, recoloring, and 3D reconstruction. This projects-based course is intended for advanced undergraduates; some programming ability and knowledge of linear algebra will be assumed. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
56409	Lecture	GH3	2:00PM -3:15PM	TR	1304 Siebel Center for Comp Sci	Gropp, W	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 3 hours Section Info: TOPIC: Computing Cluster Challenge. Covers major aspects of parallel computing on clusters with GPGPU- based compute accelerators, including system management for clusters, parallel programming models, tuning and debugging parallel applications, and evaluating tools for parallel computing. The course includes lab time to be arranged. Prerequisite: ECE 391 or CS 433 or ECE 498AL or CS 420. Restriction(s): Restricted to Undergrad - Urbana-Champaign.
42391	Lecture	JH3	12:30PM -1:45PM	TR	1103 Siebel Center for Comp Sci	Hockenmaier, J	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 3 hours Section Info: Topic: Introduction to Natural Language Processing This course will provide an introduction to computational linguistics, from morphology (word formation) and syntax (sentence structure) to semantics (meaning) and natural language processing applications such as parsing, machine translation, generation and dialog systems. Prerequisites: Formal language and automata theory (CS373 or equivalent). Programming experience is necessary for the assignments. Prior exposure to linguistics is not required. This section is for either undergraduate or graduate students.
50658	Lecture	JH4	12:30PM -1:45PM	TR	1103 Siebel Center for Comp Sci	Hockenmaier, J	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 4 hours Section Info: Topic: Introduction to Natural Language Processing This course will provide an introduction to computational linguistics, from morphology (word formation) and syntax (sentence structure) to semantics (meaning) and natural language processing applications such as parsing, machine translation, generation and dialog systems. Prerequisites: Formal language and automata theory (CS373 or equivalent). Programming experience is necessary for the assignments. Prior exposure to linguistics is not required. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
55919	Lecture	MS3	11:00AM -12:15PM	TR	1111 Siebel Center for Comp Sci	Snir, M	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 3 hours Section Info: Topic: Theory of Parallel Computing. Prerequisite: CS 473 or equivalent. Previous experience in parallel computing is useful, but not required. Parallel computing models: Which aspects of parallel computation do they capture and which not; relations between models Parallel combinatorial algorithms: Sorting, graph algorithms, parallel computational geometry; basic algorithmic patterns Lower bounds: communication complexity, information bounds Synchronization and communication: Load balancing and work stealing algorithms; concurrent data structures Networks: Topologies: Butterfly, Benes, Fat trees, meshes, hypercubes Routing: circuit switching, packet switching, wormhole routing Deterministic and randomized routing -- lower and upper bounds The course aims at providing to students interested in parallel computing the theoretical underpinnings needed for research in this area. This section is for undergraduate or graduate students.
55920	Lecture	MS4	11:00AM -12:15PM	TR	1111 Siebel Center for Comp Sci	Snir, M	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 4 hours Section Info: Topic: Theory of Parallel Computing. Prerequisite: CS 473 or equivalent. Previous experience in parallel computing is useful, but not required. Parallel computing models: Which aspects of parallel computation do they capture and which not; relations between models Parallel combinatorial algorithms: Sorting, graph algorithms, parallel computational geometry; basic algorithmic patterns Lower bounds: communication complexity, information bounds Synchronization and communication: Load balancing and work stealing algorithms; concurrent data structures Networks: Topologies: Butterfly, Benes, Fat trees, meshes, hypercubes Routing: circuit switching, packet switching, wormhole routing Deterministic and randomized routing -- lower and upper bounds The course aims at providing to students interested in parallel computing the theoretical underpinnings needed for research in this area. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
52151	Lecture	SNK	9:30AM -10:45AM	TR	1129 Siebel Center for Comp Sci	Kamin, S	Part of Term: 1 Date Range: 08/23/10-12/08/10 Credit: 3 hours Section Info: Topic - Generative Programming. Generative programming is programming by writing programs that produce other programs. It can be used to increase programmer productivity and program efficiency. Researchers are concerned about efficiency (especially for run-time program generation) and type-correctness; also, applications of the technique in different domains can present different challenges. We will review the research in these three areas: efficiency, type-checking, and applications. Students will apply generative programming in an application area of their own choosing. Prerequisite: CS 421