Spring 2011 Courses

600.103 (E)

FUNDAMENTALS OF PRACTICAL COMPUTING (3) Ken Church

Intended audience: students majoring in science, engineering or medicine. This course will provide a sampling of the theory behind and practical use of a broad spectrum of computational tools and technologies. We will start with Scratch (a programming language for kids) and show how many of the same concepts show up in Web Programming (HTML & Javascript). There will be a taste of algorithms, databases (SQL), Unix, statistics packages (R), data mining and visualization tools (graphviz), natural language processing, web search, interpreted languages (Python & LISP), compiled languages (C), and more. Students should come away with a few tools and concepts that will prove useful in their major, as well as the confidence that they can search the web to find what they need, when they need it, just-in-time.

TuTh 3-4:15
limit 40, non-CS majors only

600.104 (H)

COMPUTER ETHICS (1) Sheela Kosaraju

Students will examine a variety of topics regarding policy, legal, and moral issues related to the computer science profession itself and to the proliferation of computers in all aspects of society, especially in the era of the Internet. The course will cover various general issues related to ethical frameworks and apply those frameworks more specifically to the use of computers and the Internet. The topics will include privacy issues, computer crime, intellectual property law -- specifically copyright and patent issues, globalization, and ethical responsibilities for computer science professionals. Work in the course will consist of weekly assignments on one or more of the readings and a final paper on a topic chosen by the student and approved by the instructor.

We 6-8p, alternate weeks
limit 20, CS majors only

600.107 (E)

INTRO TO PROGRAMMING IN JAVA (3) Selinski

This course introduces the fundamental programming concepts and techniques in Java and is intended for all who plan to use computer programming in their studies and careers. Topics covered include control structures, arrays, functions, recursion, dynamic memory allocation, simple data structures, files, and structured program design. Elements of object-oriented design and programming are also introduced. Students without prior exposure are strongly advised to also take 600.108.

Prereq: familiarity with computers.

MW 1:30-2:45
limit 120

600.108 (E)

INTRO PROGRAMMING LAB (1) Selinski

Satisfactory/Unsatisfactory only. Must be taken in conjunction with 600.107. The purpose of this course is to give novice programmers extra hands-on practice with guided supervision. Students will work in pairs each week to develop working programs, with checkpoints for each development phase.

Co-Requisite: 600.107.

Sec 1: Wed 4:30-7:30p
Sec 2: Thu 6-9p
Sec 3: Fri 1:30-4:30p
limit 16/section

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Froehlich

This course covers intermediate to advanced programming in both C and C++. The focus of the course is on programming techniques and implementations. Students are expected to learn syntax and low-level language features independently. Coursework involves significant programming projects in both languages.

Prereq: AP CS, 600.107 or 600.226.

MWF 11
limit 20/section
Sec 1: Tu 4:30
Sec 2: Tu 11

600.226 (E,Q)

DATA STRUCTURES (3) Hager

This course covers the design and implementation of data structures including arrays, stacks, queues, linked lists, binary trees, heaps, balanced trees (e.g. 2-3 trees, AVL-trees) and graphs. Other topics include sorting, hashing, memory allocation, and garbage collection. Course work involves both written homework and Java programming assignments.

Prereq: AP CS, 600.107 or 600.120.

TuTh 3-4:15
limit 60

600.250 (E)

USER INTERFACES AND MOBILE APPLICATIONS (3) Selinski

This course will provide students with a rich development experience, focused on the design and implementation of user interfaces and mobile applications. A brief overview of human computer interaction will provide context for designing, prototyping and evaluating user interfaces. Students will invent their own mobile applications and implement them using the Android SDK, which is JAVA based. An overview of the Android platform and available technologies will be provided, as well as XML for layouts, and general concepts for effective mobile development. Students will be expected to explore and experiment with outside resources in order to learn technical details independently. There will also be an emphasis on building teamwork skills, and on using modern development techniques and tools.

Prereq: 600.120 and 600.226.

TuTh 3-4:15
limit 35

600.271 (E,Q)

AUTOMATA and COMPUTATION THEORY (3) Kosaraju

This course is an introduction to the theory of computing. topics include design of finite state automata, pushdown automata, linear bounded automata, Turing machines and phrase structure grammars; correspondence between automata and grammars; computable functions, decidable and undecidable problems, P and NP problems, NP-completeness, and randomization. Students may not receive credit for 600.271 and 600.471 for the same degree.

TuTh 1:30-2:45
limit 60

600.318 (E)

OPERATING SYSTEMS (4) Froehlich

This course covers the fundamental topics related to operating systems theory and practice. Topics include processor management, storage management, concurrency control, multi-programming and processing, device drivers, operating system components (e.g., file system, kernel), modeling and performance measurement, protection and security, and recent innovations in operating system structure. Course work includes the implementation of operating systems techniques and routines, and critical parts of a small but functional operating system. [Systems]

Prereq: 600.120, 600.226, and 600.333. 600.211 Recommended. Students may receive credit for 600.318 or 600.418, but not both.

MWF 1:30
limit 30

600.325 (E)

DECLARATIVE METHODS (3) Eisner

Suppose you could simply write down a description of your problem, and let the computer figure out how to solve it. What notation could you use? What strategy should the computer then use? In this survey class, you'll learn to recognize when your problem is an instance of satisfiability, constraint programming, logic programming, dynamic programming, or mathematical programming (e.g., integer linear programming). For each of these related paradigms, you'll learn to reformulate hard problems in the required notation and apply off-the-shelf software that can solve any problem in that notation -- including NP-complete problems and many of the problems you'll see in other courses and in the real world. You'll also gain some understanding of the general-purpose algorithms that power the software. [Analysis]

Prereq: 600.226, Calc II. Students can only receive credit for 600.325 or 600.425, not both.

MWF 3
limit 30

600.328 (E)

ADDED!

COMPILERS & INTERPRETERS (3) Froehlich

Introduction to compiler design, including lexical analysis, parsing, syntax-directed translation, symbol tables, run-time environments, and code generation and optimization. Students are required to write a compiler as a course project. [Systems]

Prereq: 600.120 & 600.226

MWF 3
limit 30

600.335 (E)

ARTIFICIAL INTELLIGENCE (3) Mitchell

Artificial intelligence (AI) is introduced by studying automated reasoning, automatic problem solvers and planners, knowledge representation mechanisms, game playing, machine learning, and statistical pattern recognition. The class is a recommended for all scientists and engineers with a genuine curiosity about the fundamental obstacles to getting machines to perform tasks such as deduction, learning, and planning and navigation. Strong programming skills and a good grasp of the English language are expected; students will be asked to complete both programming assignments and writing assignments. The course will include a brief introduction to scientific writing and experimental design, including assignments to apply these concepts.[Applications]

Prereq: 600.226, 550.171; Recommended: linear algebra, prob/stat. Students can only receive credit for 600.335 or 600.435, not both.

WF 12-1:15
limit 30

600.344 (E)

COMPUTER NETWORK FUNDAMENTALS (3) Terzis

This course considers intersystem communications issues. Topics covered include layered network architectures; the OSI model; bandwidth, data rates, modems, multiplexing, error detection/correction; switching; queuing models, circuit switching, packet switching; performance analysis of protocols, local area networks; and congestion control. [Systems]

Prereq: 600.333 or 600.433 or permission. Students can only receive credit for 600.344 or 600.444, not both.

TuTh 12-1:15
limit 30

600.357 (E,Q)

COMPUTER GRAPHICS (3) Kazhdan

This course introduces computer graphics techniques and applications, including image processing, rendering, modeling and animation. Students may receive credit for 600.357 or 600.457, but not both. [Applications]

Prereq: 600.120 (C++), 600.226, linear algebra. Permission of instructor is required for students not satisfying a pre-requisite.

MWF 11
limit 30

600.363 (E,Q)

INTRODUCTION TO ALGORITHMS (3) Ateniese

This course concentrates on the design of algorithms and the rigorous analysis of their efficiency. topics include the basic definitions of algorithmic complexity (worst case, average case); basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications (such as union-find); graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis.

Prereq: 600.226 or Perm. Req'd. Students may receive credit for 600.363 or 600.463, but not both.

TuTh 3-4:15
limit 30

600.392 (E)

SENIOR DESIGN PROJECT (3) Froehlich

This course will give senior CS majors an intensive capstone design project experience. Students will work in groups with real world customers to develop a working system. Project design, management and communication skills will be emphasized. Software development methodologies may also be presented. [General]

Prereq: 600.120, 600.226; 600.321 recommended.

CANCELLED (was MW 3-4:15)
limit 30, CS senior majors only

600.402 (E)

MEDICAL INFORMATICS (1) Lehmann

Key decision makers in government and industry and across the world believe that health information technology is crucial to improving health and safety and cutting costs, and are investing billions of dollars over the next few years to test that belief. In this course, you will learn to understand this new context and to figure out what role you might play in it.

Short course meets 4 weeks 1/31-2/23.

MW 4:30-5:45
4 weeks: 1/31-2/23
limit 30

600.405 (E, Q)

NEW COURSE!

APPLICATIONS OF PROBABILISTIC GRAPHICAL MODELS IN LANGUAGE AND SPEECH PROCESSING (1) Stoyanov, Klementiev & Bergsma

Probabilistic graphical models (PGMs) combine ideas from statistics and computer science into a unifying framework for modeling complex real-world phenomena. PGMs are now widespread in language and speech processing. PGMs are well suited to handle the inherent challenges of linguistic problems: complex and structured relationships, a large number of relevant attributes, and large volumes of data. This short course will provide students with advanced training in several specific applications of graphical models that are important in natural language processing. After reviewing the essentials of directed and undirected graphical models, we will discuss complex CRFs, approximate inference including variational and MCMC methods, Bayesian models and non-parametric Bayesian models including Chinese Restaurant Processes. Students will also gain practical experience by solving problems using existing PGM software. Short course.

Recommended: 600.465

F 11
limit 30

600.412 (E)

SECURITY & PRIVACY IN CLOUD COMPUTING (1) Hasan

This course focuses on the security and privacy issues in Cloud Computing systems. While the cloud computing paradigm gains more popularity, there are many issues related to confidentiality, integrity, and availability of data and computations involving a cloud. In this course, we examine cloud computing models, look into the threat model and security issues related to data and computation outsourcing, and explore practical applications of secure cloud computing. Short course.

Prereq: some background in network and/or data security recommended.

M 3-3:50
limit 30

600.417 (E)

DATA STREAM PROCESSING (3) Ahmad

Data stream processing has emerged as a model for building computing applications that face tremendous volumes of dynamically changing data, and are required to process such data in a timely fashion. Examples include a variety of web-driven applications, such as web advertising based on Facebook and Twitter status streams, and more generally, monitoring and analysis applications including algorithmic trading on stock ticks and order books, network monitoring for denial of service attacks, and location-based applications working with GPS data streams. This course will study data stream processing from a data management and algorithms perspective. Students will be introduced to the fundamentals of data stream processing systems and architectures, incremental (windowed) stream processing languages, and stream algorithms that embody the principle of "you only get one look" when having to continually deal with data arriving at high rates. This course will provide students with significant implementation experience, in the spirit of a practicum. Students will proceed through a series of homework projects to build a data stream processor from scratch, and will use the resulting stream engine along with stream mining algorithms to analyze Twitter feeds. This course is aimed at upper-level undergraduates with prior programming experience. Graduate students should consider taking 600.617 instead. [Systems]

Prereq: 600.120, 600.226 and 600.315/415. Students may receive credit for 600.417 or 600.617, but not both.

MW 12-1:15
limit 30

600.418 (E)

OPERATING SYSTEMS (3) Froehlich

Graduate level version of 600.318. [Systems]

Prereq: 600.226, and 600.333; 600.211 recommended. Students may receive credit for 600.318 or 600.418, but not both.

MWF 1:30
limit 30

600.424 (E)

NETWORK SECURITY (3) Sam Small

This course focuses on communication security in computer systems and networks. The course is intended to provide students with an introduction to the field of network security. The course covers network security services such as authentication and access control, integrity and confidentiality of data, firewalls and related technologies, Web security and privacy. Course work involves implementing various security techniques. A course project is required. [Systems]

Prereq: 600.226, 600.344/444 or permission; 600.120 (or equivalent) recommended.

W 3-5:30
limit 20

600.425 (E)

DECLARATIVE METHODS (3) Eisner

Graduate level version of 600.325. [Analysis]

Prereq: 600.226, Calc II. Students can only receive credit for 600.325 or 600.425, not both.

MWF 3
limit 30

600.426 (E,Q)

PRINCIPLES OF PROGRAMMING LANGUAGES (3) Smith

Functional, object-oriented, and other language features are studied independent of a particular programming language. Students become familiar with these features by implementing them. Most of the implementations are in the form of small language interpreters. Some type checkers and a small compiler will also be written. The total amount of code written will not be overly large, as the emphasis is on concepts. The ML programming language is the implementation language used. [Analysis]

Prereq: 600.226. Freshmen and sophomores by permission only.

MW 1:30-2:45
limit 40

600.427 (E)

DATA ORGANIZATION: STORAGE AND EXTERNAL MEMORY SYSTEMS (3) Burns

This course will examine the complex relationship between computer architectures and software systems that store, organize, and access data. Storage systems have always co-evolved with technology. But, today's computing landscape places unique demands on next generation storage systems. Technology drivers include: new storage devices, such as solid-state drives and phase-change memory, cloud computing, virtualization, and modern multicore and manycore processors with steep hierarchies of shared caches. The course will provide an overview of modern storage systems, including parallel file systems, key/value stores, scan engines, in-memory databases, archival storage, and content-based storage. It will cover the techniques used to organize storage in these systems, such as indexes, replication and coding, spatial trees, and space-filling curves. The course will also explore external memory data structures and algorithms that provide a framework for analyzing storage designs. [Systems]

Prereq: 600.226, 600.315/415 and 600.333/433 or perm.

MW 4:30-5:45
limit 20

600.428 (E)

ADDED!

COMPILERS & INTERPRETERS (3) Froehlich

Graduate level version of 600.328. Students may receive credit for 600.328 or 600.428, but not both. [Systems]

Prereq: 600.120 & 600.226

MWF 3:00
limit 30

600.435 (E)

ARTIFICIAL INTELLIGENCE (3) Mitchell

Graduate level version of 600.335. [Applications]

Prereq: 600.226, 550.171; Recommended: linear algebra, prob/stat. Students can only receive credit for 600.335 or 600.435, not both.

WF 12-1:15
limit 30

600.444 (E)

COMPUTER NETWORKS (3) Terzis

Graduate level version of 600.344. [Systems]

Prereq: 600.333 or 600.433 or permission. Students can only receive credit for 600.344 or 600.444, not both.

TuTh 12-1:15
limit 30

600.446 (E)

COMPUTER INTEGRATED SURGERY II (3) Taylor

This weekly lecture/seminar course addresses similar material to 600.445, but covers selected topics in greater depth. In addition to material covered in lectures/seminars by the instructor and other faculty, students are expected to read and provide critical analysis/presentations of selected papers in recitation sessions. Students taking this course are required to undertake and report on a significant term project under the supervision of the instructor and clinical end users. Typically, this project is an extension of the term project from 600.445, although it does not have to be. Grades are based both on the project and on classroom recitations. Students wishing to attend the weekly lectures as a 1-credit seminar should sign up for 600.452. Students may also take this course as 600.646. The only difference between 600.446 and 600.646 is the level of project undertaken. Typically, 600.646 projects require a greater degree of mathematical, image processing, or modeling background. Prospective students should consult with the instructor as to which course number is appropriate. [Applications]

Prereq: 600.445 or perm req'd. Students may receive credit for 600.446 or 600.646, but not both.

TuTh 1:30-2:45
limit 40

600.452 (E)

COMPUTER INTEGRATED SURGERY SEMINAR (1) Taylor

Lecture only version of 600.446 (no project).

Prereq: 600.445 or perm req'd. Students may receive credit for 600.446 or 600.452, but not both.

TuTh 1:30-2:45
limit 10

600.454 (E)

NEW LSITING!

PRACTICAL CRYPTOGRAPHIC SYSTEMS (3) Green

[Co-listed with 650.445.] This semester-long course will teach systems and cryptographic design principles by example: by studying and identifying flaws in widely-deployed cryptographic products and protocols. Our focus will be on the techniques used in practical security systems, the mistakes that lead to failure, and the approaches that might have avoided the problem. We will place a particular emphasis on the techniques of provable security and the feasibility of reverse-engineering undocumented cryptographic systems. [Systems]

TuTh 1:30-2:45
limit 30

600.457 (E,Q)

COMPUTER GRAPHICS (3) Kazhdan

Graduate level verson of 600.357. Students may receive credit for 600.357 or 600.457, but not both. [Applications]

Prereq: 600.120 (C++), 600.226, linear algebra. Permission of instructor is required for students not satisfying a pre-requisite.

MWF 11
limit 30

600.463 (E,Q)

ALGORITHMS I (3) Ateniese

Graduate version of 600.363. Students may receive credit for 600.363 or 600.463, but not both.

Prereq: 600.226 or Perm. req'd.

TuTh 3-4:15
limit 30

600.466 (E)

INFORMATION RETRIEVAL & WEB AGENTS (3) Yarowsky

An in-depth, hands-on study of current information retrieval techniques and their application to developing intelligent WWW agents. Topics include a comprehensive study of current document retrieval models, mail/news routing and filtering, document clustering, automatic indexing, query expansion, relevance feedback, user modeling, information visualization and usage pattern analysis. In addition, the course explores the range of additional language processing steps useful for template filling and information extraction from retrieved documents, focusing on recent, primarily statistical methods. The course concludes with a study of current issues in information retrieval and data mining on the World Wide Web. Topics include web robots, spiders, agents and search engines, exploring both their practical implementation and the economic and legal issues surrounding their use. [Applications]

Prereq: 600.226

TuTh 3-4:15
limit 60

600.488 (E)

FOUNDATIONS OF COMPUTATIONAL BIOLOGY AND BIOINFORMATICS II (3) Karchin

[Co-listed with 580.488.] This course will introduce probabilistic modeling and information theory applied to biological sequence analysis, focusing on statistical models of protein families, alignment algorithms, and models of evolution. Topics will include probability theory, score matrices, hidden Markov models, maximum likelihood, expectation maximization and dynamic programming algorithms. Homework assignments will require programming in Python. Foundations of Computational Biology I is not a prereq. [Analysis]

Prerequisites: math through linear algebra and differential equations, 580.221 or equiv., 600.226 or equiv.

tbd
org. mtg. 1/31/2011 at 4pm in 110 Clark Hall
limit 5

600.492 (E)

COMPUTER SCIENCE WORKSHOP II

Permission of faculty sponsor is required. See below for faculty section numbers.

600.504

UNDERGRADUATE INDEPENDENT STUDY

For undergraduate students. Permission of faculty sponsor is required. See below for faculty section numbers.

600.508

UNDERGRADUATE RESEARCH

Permission of faculty sponsor is required. See below for faculty section numbers.

600.510

COMPUTER SCIENCE INTERNSHIP

Individual work in the field with a learning component, supervised by a faculty member in the department. The program of study must be worked out in advance between the student and the faculty member involved. Students may not receive credit for work that they are paid to do. As a rule of thumb, 40 hours of work is equivalent to one credit, which is the limit per semester.

Permission of faculty sponsor is required.

See below for faculty section numbers.

600.520

SENIOR HONORS THESIS (3)

For computer science majors only, a continuation of 600.519.

Prerequisite: 600.519

See below for faculty section numbers.

600.546 (E)

SENIOR THESIS IN COMPUTER INTEGRATED SURGERY (3)

Prereq: 600.445 or perm req'd.

Section 01: Taylor

600.602

COMPUTER SCIENCE SEMINAR

Required for all CS PhD students. Strongly recommended for MSE students.

TuTh 10:30-12
limit 90

600.617

DATA STREAM PROCESSING Ahmad

Advanced (graduate) version of 600.417. [Systems]

Prereq: 600.315/415. Students may receive credit for 600.417 or 600.617, but not both.

MW 12-1:15
limit 20

600.646

COMPUTER INTEGRATED SURGERY II Taylor

Advanced version of 600.446. [Applications]

Prereq: 600.445 or perm req'd. Students may receive credit for 600.446 or 600.646, but not both.

TuTh 1:30-2:45
limit 10

600.647

Cancelled

ADVANCED TOPICS IN WIRELESS NETWORKS Mishra

This class will survey current research in wireless communication networks. These types of networks have been growing exponentially in the past several years and include a host of different network types: ad hoc, cell phone, access point, sensor, etc. The class will build understanding of all layers of wireless networking and the interactions between them (including: physical, data link, medium access control, routing, transport, and application). The topics of security, energy efficiency, mobility, scalability, and their unique characteristics in wireless networks will be discussed. [Systems or Analysis]

Prereq: 600.344/444 & 600.363/463, or permission of the instructor.

(was MW 12-1:15)
limit 15

600.666

INFORMATION EXTRACTION Khudanpur

Introduction to statistical methods of speech recognition (automatic transcription of speech) and understanding. The course is a natural continuation of 600.465 but is independent of it. Topics include elementary information theory, hidden Markov models, the Baum and Viterbi algorithms, efficient hypothesis search methods, statistical decision trees, the estimation-maximization (EM) algorithm, maximum entropy estimation and estimation of discrete probabilities from sparse data for acoustic and language modeling. Weekly assignments and several programming projects.

Prerequisites: 550.310 or equivalent, expertise in C or C++ programming. Co-listed with 050.666 and 520.666.

TuTh 9:00-10:15
limit 15

600.667

ADVANCED DISTRIBUTED SYSTEMS AND NETWORKS Amir

The course explores the state of the art in distributed systems, networks and Internet research and practice, trying to see what it would take to push the envelop a step further. The course is conducted as a discussion group, where the professor and students brainstorm and pick interesting semester-long projects with high potential future impact. Example areas include robust scalable infrastructure (distributed datacenters, cloud networking, scada systems), real-time performance (remote surgery, trading systems), hybrid networks (mesh networks, 3-4G/Wifi/Bluetooth). Students should feel free to bring their own topics of interest and ideas. [Systems]

Prereq: a systems course (distributed systems, operating systems, computer networks, parallel programming), or permission of instructor.

MW 3-4:15
limit 15

600.688

FOUNDATIONS OF COMPUTATIONAL BIOLOGY AND BIOINFORMATICS II Karchin

[Co-listed with 580.688.] Graduate version of 600.488. Foundations of Computational Biology I is not a prereq. [Analysis]

Prerequisites: math through linear algebra and differential equations, 580.221 or equiv., 600.226 or equiv.

tbd
org. mtg. 1/31/2011 at 4pm in 110 Clark Hall
limit 20

520.702

CURRENT TOPICS IN LANGUAGE AND SPEECH PROCESSING Khudanpur

CLSP seminar series, for any students interested in current topics in language and speech processing.

Tu 4:30-5:45 & Fr 12-1:15

600.726

SEMINAR IN PROGRAMMING LANGUAGES Smith

This seminar course covers recent developments in the foundations of programming language design and implementation. Topics covered include type theory, process algebra, higher-order program analysis, and constraint systems. Students will be expected to present papers orally.
Prereq: permission of instructor

W 11

600.735

SEMINAR IN MACHINE LEARNING Sheppard

This seminar course will look at research in machine learning. Topics will be selected from those of mutual interest between students and the instructor. Sample topics include reinforcement learning, kernel methods, experimental methods in machine learning, computational learning theory, lazy learning, evolutionary computation, and neural networks. Students are expected to select papers and lead discussion.

Th 1:30

600.745

SEMINAR IN COMPUTER INTEGRATED SURGERY Kazanzides

This weekly seminar will focus on research issues in computer integrated surgery, including subjects such as medical image analysis, statistical modeling, visualization, vision/sensing, surgical planning, medical robotics, and clinical applications. The purpose of the course is to widen the knowledge and awareness of the participants in current research in these areas, as well as to promote greater awareness and interaction between multiple research groups within the University and beyond. The format of the course is informal presentation by a pre-eminent invited speaker, followed by free discussion.

W 12-1:15
limit 60

600.746

MEDICAL IMAGE ANALYSIS SEMINAR Taylor & Prince

This weekly seminar will focus on research issues in medical image analysis, including image segmentation, registration, statistical modeling, and applications. It will also include selected topics relating to medical image acquisition, especially where they relate to analysis. The purpose of the course is to provide the participants with a thorough background in current research in these areas, as well as to promote greater awareness and interaction between multiple research groups within the University. The format of the course is informal. Students will read selected papers. All students will be assumed to have read these papers by the time the paper is scheduled for discussion. But individual students will be assigned on a rotating basis to lead the discussion on particular papers or sections of papers. Co-listed with 520.746.

Tu 3-4:50

600.754

SEMINAR ON STATISTICAL ANATOMIC MODELS, REGISTRATION, AND RECONSTRUCTION Taylor

This weekly research seminar will focus generally on statistical modeling of anatomic structures, image and model registration, 3D image reconstruction methods, and their interrelationships. We will concen-trate primarily, though not exclusively, on x-ray based imaging modalities (x-ray fluoroscopy, CT, cone-beam tomography, "hybrid" reconstruction methods, etc.).

Th 9-9:50

600.757

SEMINAR IN COMPUTER GRAPHICS Kazhdan

In this course we will review current research in computer graphics. We will meet for an hour once a week and one of the participants will lead the discussion for the week.

TBD

600.765

SEMINAR IN NATURAL LANGUAGE PROCESSING Eisner

A reading group exploring important current research in the field and potentially relevant material from related fields. Enrolled students are expected to present papers and lead discussion.

Pre-req: 600.465 or permission of instructor.

Th 12-1:15

600.766

SEMINAR IN MEANING, TRANSLATION AND GENERATION OF TEXT Callison-Burch & VanDurme

The weekly machine translation reading group will review current research and survey articles on the topics of computational semantics, statistical machine translation, and natural language generation. Enrolled students will present papers and lead discussions.

Tu 12-1

600.775

CURRENT TOPICS IN MACHINE LEARNING Dredze

A reading group exploring current research topics in machine learning. Topics will be selected based on interests of the students and the instructor. Papers will include current research and tutorials. Our focus will be on core machine learning methods as opposed to applications. Enrolled students are expected to present papers and lead discussion.

Wed 12-1:15

600.802

DISSERTATION RESEARCH

See below for faculty section numbers.

600.804

GRADUATE RESEARCH

Independent research for masters or pre-dissertation PhD students. Permission required.

See below for faculty section numbers.

600.810

GRADUATE INDEPENDENT STUDY

Permission Required.

See below for faculty section numbers.