Winter 2007 CS 2x9 Course Descriptions

Winter 2007
CS 2x9 Course Descriptions


COM SCI 219 Computer System Modeling Analysis
LEC 1 GERLA, M.
ID Number	Type	Sec	Days	Start	Stop	Bldg	Rm
587114200	LEC	1	MW	10:00A	11:50A	BOELTER	5419
Title: Peer-to-Peer Networks with Mobile Applications This seminar oriented course overviews the basic architecture of Peer to Peer (P2P) networks and describes models and tools used for the design and evaluation of such networks. Several examples of P2P networks will be presented, drawing both from well established Internet implementations and from emerging wireless, mobile environments such as vehicular and "nomadic" networks. The course will include instructor, student and guest presentations, class quizzes and a term project. Recommended Prerequisites: Graduate standing (open also to a limited number of undergraduate students) Grade Basis: Grade based on class quizzes, class presentations and project term paper


COM SCI 259 Computer Science - System Design
LEC 1 SARRAFZADEH, M.
ID Number	Type	Sec	Days	Start	Stop	Bldg	Rm
587357200	LEC	1	TR	2:00P	3:50P	PUB POL	2238
Title: Reconfigurable Computing NOTE: For the first week (January 9th/11th) the course will meet in Boelter 4760! "Reconfigurability is changing the way people design and is reconfiguring the industry" Today's embedded systems contain various combinations of different sub-systems, such as ASICs, microprocessors, DSPs, and reconfigurable cores. Markets change very rapidly demanding embedded system solutions that are easily alterable. Such solutions are expected to support a variety of applications, changing system requirements and standards as well as altering operating conditions. Reconfigurable cores in embedded systems provide the adaptability and reconfigurability that is required. In addition many high performance operations, such as computationally intensive multimedia applications can be implemented very efficiently using reconfigurable logic. In this course we review reconfigurable systems from a software/architecture/ algorithmic point of view and then investigate a number of research issues. Recommended Prerequisites: No formal prerequisites Grade Basis: Grade based on projects Text: Research Papers


COM SCI 269 Artificial Intelligence
SEM 1 FALOUTSOS, P.
ID Number	Type	Sec	Days	Start	Stop	Bldg	Rm
587410269	SEM	1	MW	4:00P	5:50P	FRANZ	2288
Title: Humanoid Character Simulation The purpose of this course is to cover a variety of state of the art techniques in humanoid computer animation. It is a seminar course that will cover the latest literature in human animation and visual modeling. Topics include: Muscle modeling and simulation, skinning, motor control, motion capture techniques, physics-based techniques and control, facial animation, and hardware accelerated rendering techniques. Requisite: CS 174A Grade Basis: Class participation: 10% Paper presentation: 30% Project proposal: 10% Project presentation: 10% Project: 40%


COM SCI 288S Theoretical Computer Science
SEM 1 MEYERSON, A.W.
ID Number	Type	Sec	Days	Start	Stop	Bldg	Rm
587538200	SEM	1	F	12:00P	1:50P	MS	7608
Title: Computer Science Theory Seminar The course will cover current topics in computer science theory. Guest speakers will be scheduled whenever possible. Recommended Prerequisites: There are no formal prerequisites, but CS 280A and/or CS 280G are recommended. Grade Basis: Students in the class will be expected to give one presentation during the term, and help to critique other students' presentations.


COM SCI 289RA Randomized Algorithms
LEC 1 GAFNI, E.M.
ID Number	Type	Sec	Days	Start	Stop	Bldg	Rm
587562200	LEC	1	MW	2:00P	3:50P	BOELTER	5422
Title: Randomized Algorithms Introduction + overview - 2-3 weeks. Tardos Kleinberg Chap 13: 13 Randomized Algorithms 13.1 A First Application: Contention Resolution 13.2 Finding the Global Minimum Cut 13.3 Random Variables and their Expectations 13.4 A Randomized Approximation Algorithm for MAX 3-SAT 13.5 Randomized Divide-and-Conquer: Median-Finding and Quicksort 13.6 Hashing: A Randomized Implementation of Dictionaries 13.7 Finding the Closest Pair of Points: A Randomized Approach 13.8 Randomized Caching 13.9 Chernoff Bounds 13.10 Load Balancing 13.11 Packet Routing Chernoff Bound, balls-Bins 1-week Mitzenmacher, Upfal chap 4-5 Geometric algorithms -1-1,5 weeks chap 9 Motwani Raghavan Minimax principle, Lovaz local lemma - 1 week in MR in Chap 2 and 5 Pseudorandom generators - 1 week Notes: Vadhan, Zukerman. Luby-Wigderson Pair-wise and K-wise independence 1-week. As above. IP=PS, Error-Correcting Codes, Expanders, PCP - rest of the time, time permitting Recommended Prerequisites: CS180 or equivalent + Maturity in Algorithms and Basic Probability Grade Basis: Lots of homeworks RR graded by the participants. Midterm on basic material to check n-disconnect. Take home final or term paper to be decided by participants. This is advanced course with "lenient grading."