Department of Computer Science, Johns Hopkins University
spacerHomeAbout UsWhy Join UsPeopleAcademicsResearchEventsServices
Department of Computer Science, Johns Hopkins Universityspacer

Spring 2010 Courses

Courses without end times are assumed to meet for 50 minute periods. Final room assignments will be available on the Registrar's website in January. Changes to the original schedule are noted in red.

600.103 (E)

FUNDAMENTALS OF PRACTICAL COMPUTING (1) Ken Church

Intended audience: students considering a major in science, engineering or medicine. This course will teach a principled introduction to the theory and practical use of a broad spectrum of computational tools and technologies. Examples include statistical analysis packages, symbolic computation (LISP), data mining and visualization, Unix, language processing, web programming and cloud computing.

T 3
limit 20, 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.

Tu 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 12-1:15
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 3-6p
Sec 2: Thu 6-9p
Sec 3: Fri 12-3p
limit 16/section

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Selinski

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.

TuTh 3-4:15
limit 20/section
Sec 1: Th 4:30
Sec 2: Fr 3
Sec 3: Fr 4

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 9-10:15
limit 60

600.255 (E)

INTRODUCTION TO VIDEO GAME DESIGN (3) Froehlich

A broad survey course in video game design (as opposed to mathematical game theory), covering artistic, technical, as well as sociological aspects of video games. Students will learn about the history of video games, archetypal game styles, computer graphics and programming, user interface and interaction design, graphical design, spatial and object design, character animation, basic game physics, plot and character development, as well as psychological and sociological impact of games. Students will design and implement an experimental video game in interdisciplinary teams of 3-4 students as part of a semester-long project.

Prereq: sophomores and above, permission of instructor; Co-req: 600.256.
Section 1 requires technical skills, including at least one programming course (preferably 2 or more). Section 2 requires artistic skills, including at least one multimedia course (preferably 2 or more).

MW 4:30-5:45
Sec 1: for technical students
Sec 2: for non-technical students
limit 20/section

600.256

INTRODUCTION TO VIDEO GAME DESIGN LAB (1) Froehlich/Freedman

A lab course in support of 600.255: Introduction to Video Game Design covering a variety of multi-media techniques and applications from image processing, through sound design, to 3D modeling and animation. See 600.255: Introduction to Video Game Design for details about enrolling. Unlike in 600.255, the sections for the lab are meant to have a cross-section of students from different backgrounds. Ideally students working on a team project will be enrolled in the same lab section.

Co-req: 600.255.

Sec 1: M 6-9
Sec 2: T 6-9
Sec 3: cancelled (was W 6-9)
Sec 4: H 6-9
limit 12/section

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 11
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 a special case of satisfiability, integer programming, rational pattern transduction, Bayesian network inference, or weighted logic programming. For each of these 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 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, 600.271, 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 1:30
limit 30

600.335 (E)

ARTIFICIAL INTELLIGENCE (3) Mitchell

Artificial intelligence (AI) is introduced by studying knowledge representation mechanisms, automated reasoning, automatic problem solvers and planners, production systems, game playing and machine learning. The class is 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. [Applications]

Prereq: 600.226, 550.171; Recommended: linear algebra, prob/stat.

WF 12-1:15
limit 30

600.336 (E)

ALGORITHMS FOR SENSOR-BASED ROBOTICS (3) Erion Plaku

This is an introductory course presenting a series of algorithms related to the representation and use of geometric models acquired from sensor data. Course topics include: basic sensing and estimation techniques, geometric model representations, and motion planning algorithms. The course will also discuss applications in diverse areas such as mobile systems, robot manipulation, and medicine. [Analysis]

Prereq: 600.226, calculus, prob/stat. Students may receive credit for 600.336 or 600.436, but not both.

TuTh 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)

CANCELLED

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
limit CS senior majors only

600.402 (E)

MEDICAL INFORMATICS (1) Lehmann

Computers and information technology has become major forces in transforming American medicine. We shall discuss some of the new entities---the computer-based patient record, clinical practice guidelines, and digital libraries---and their underlying technologies: networks, databases, controlled vocabularies, and decision analysis.

Short course meets 4 weeks (2/15-3/10).

MW 4:30-5:45
4 weeks: 2/15-3/10
limit 30

600.412 (E)

NEW COURSE!

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.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 11
limit 30

600.424 (E)
NEW LISTING

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, 600.271, Calc II. Students can only receive credit for 600.325 or 600.425, not both.

MWF 3
limit 30

600.426 (E,Q)

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 60

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 1:30
limit 30

600.430 (HQ)

ONTOLOGIES AND KNOWLEDGE REPRESENTATION (3) Rynasiewicz

(Cross-listed in Philosophy) Knowledge representation (KR) deals with the possible structures by which the content of what is known can be formally represented in such a way that queries can be posed and inferences drawn. Ontology concerns the hierarchi- cal classification of entities from given domains of knowledge together with the relations between various classes or subclasses. We begin with KR, examining the standard variety of frameworks developed or implemented over the last twenty years, including 1st-order logic and automated theo- rem proving, networks, frames, and description logics. Then we move on to a study of the problems inherent in ontology development and examine the some of the currently prevalent environments, including Universal Modeling Language, OWL and Protege', RDFS and semantic web applications. [Analysis]

Prereq: faculty permission; 600.107 and 600.271 or their equivalents are recommended.

TuTh 9-10:15
limit 10

600.435 (E)

ARTIFICIAL INTELLIGENCE (3) Mitchell

Graduate level version of 600.335 (see description above). [Applications]

Prereq: 600.226, 550.171; Recommended: linear algebra, prob/stat.

WF 12-1:15
limit 30

600.436 (E)

ALGORITHMS FOR SENSOR-BASED ROBOTICS (3) Erion Plaku

Graduate level version of 600.336 (see description above). [Analysis]

Prereq: 600.226, calculus, prob/stat. Students may receive credit for 600.336 or 600.436, but not both.

TuTh 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 60

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.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.464 (E,Q)

RANDOMIZED ALGORITHMS (3) Kosaraju

Selected topics in algorithm design and analysis such as advanced data structures, amortization, graph algorithms, algebraic complexity, network flow, circulations, matching, randomization. [Analysis]

Prereq: 600.363 or 600.463. Students may receive credit for 600.464 or 600.664, but not both.

TuTh 1:30-2:45
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.478 (E)

VISUAL IMAGING IN SURGERY AND MEDICINE (3) Kumar

A survey course in visual imaging registration and fusion methods and its applications in surgery and medicine. Such applications are common in medical imaging including integration of CT, MRI, ultrasound, PET, and other sensing. However, compared to these sensing technologies visual imaging requires more efficient computation and stronger emphasis on contextual and temporal information. Key goals for such methods include multi-resolution, and multi-temporal registration and superresolution. A large body of work and practical applications using visual imaging exist in remote sensing, surveillance, and robot vision, but methods for surgical visualization are relatively rare and new. This course aims to provide background on devices, methods, and applications for visual imaging in medicine and surgery including recent work in the field. Students will design and implement registration methods based on data sets provided as part of a semester-long team project. [Applications]

Prereq: 600.226, 600.461; recommended: linear algebra, 600.445.

WF 3-4:15
limit 30

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.

MW 4:30-5:45
limit 20

600.492 (E)

COMPUTER SCIENCE WORKSHOP II

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

600.504

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 grad students.

TuTh 10:30-12

600.604

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.620

EXTERNAL MEMORY DATA STRUCTURES AND ALGORITHMS Burns

This course will cover data structures and algorithms for managing external memory with applications to file systems, databases, parallel architectures, and high-performance computing. Topics will include cost models for external memory, elementary algorithms (scanning, sorting, permuting), data structures (lists, arrays, B-trees), spatial data structures, algorithms for tree, graph, geometric, and spatial data, and the parallelization of data structures and algorithms. This course is intended for students interested in conducting research on or related to these topics. Students will conduct a semester long research project and present their results to the class. In addition to the scheduled meetings, students will have weekly one-on-one meetings with the professor. [Systems or Analysis]

Prereq: Prerequisite: 600.363/463 and one of 600.315/415, 600.318/418, 600.316/416, 600.319/419 or permission of instructor.

MW 4:30-5:45
limit 30

600.643

ADVANCED TOPICS IN COMPUTER SECURITY (3) Rubin

Topics will vary from year to year, but will focus mainly on network perimeter protection, host-level protection, authentication technologies, intellectual property protection, formal analysis techniques, intrusion detection and similarly advanced subjects. Emphasis in this course is on understanding how security issues impact real systems, while maintaining an appreciation for grounding the work in fundamental science. Students will study and present various advanced research papers to the class. There will be homework assignments and a course project. [Systems or Applications]

Prereq: 600.443 or 600.424; or permission of instructor.

MW 10-11:15 (was 1:30-2:45)
limit 20

600.646

COMPUTER INTEGRATED SURGERY II (3) 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 30

600.647

ADVANCED TOPICS IN WIRELESS NETWORKS (3) Awerbuch & 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.

MW 12-1:15
limit 30

600.664

RANDOMIZED ALGORITHMS (3) Kosaraju

Graduate level version of 600.464. [Analysis]

Prereq: 600.363 or 600.463. Students may receive credit for 600.464 or 600.664, but not both.

TuTh 1:30-2:45
limit 30

600.666

INFORMATION EXTRACTION (3) 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 30

600.675
New Course!

ADVANCED TOPICS IN MACHINE LEARNING: MODELING & SEGMENTATION OF MULTIVARIATE MIXED DATA (3) Vidal

The aim of this course is to describe the foundations of computational methods for the statistical and dynamical modeling of multivariate data. The emphasis of this course is to use methods from algebraic geometry, probability theory and dynamical systems theory to build models of data. Topics include nonlinear dimensionality reduction (PCA, LLE), unsupervised learning (central clustering, subspace clustering, GPCA), and estimation and identification of dynamical systems (Kalman filtering, subspace identification, hybrid system identification). We will apply these tools to model data from computer vision, biomedical imaging, neuroscience, and computational biology. [Applications]

Co-listed with 580.692

MWF 12 (was TuTh 12:00-1:15)
limit 30

600.688 (E)

FOUNDATIONS OF COMPUTATIONAL BIOLOGY AND BIOINFORMATICS II (4) 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.

MW 4:30-5:45
limit 20

600.726

SEMINAR IN PROGRAMMING LANGUAGES (1) 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 3

600.735

SEMINAR IN MACHINE LEARNING (1) 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 (1) 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 (1) 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.757

SEMINAR IN COMPUTER GRAPHICS (1) Simari

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.

TBA

600.765

SEMINAR IN NATURAL LANGUAGE PROCESSING (1) 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 MACHINE TRANSLATION (1) Callison-Burch

The weekly machine translation reading group will review current research in statistical machine translation, and well as relevant historical papers. Enrolled students will present papers and lead discussions.

Tu 1:30

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

INDEPENDENT STUDY

Permission Required.

See below for faculty section numbers.

Faculty section numbers for all independent type courses, undergraduate and graduate.

01 - Gerry Masson
02 - Rao Kosaraju
03 - Baruch Awerbuch
04 - Russ Taylor
05 - Scott Smith
06 - Joanne Houlahan
07 - Harold Lehmann
08 - John Sheppard
09 - Greg Hager
10 - Greg Chirikjian
11 - Sanjeev Khudhanpur
12 - Yair Amir
13 - David Yarowsky
14 - Noah Cowan
15 - Randal Burns
16 - Jason Eisner
17 - Jon Shapiro
18 - Susan Hohenberger
19 - Rachel Karchin
20 - Guiseppe Ateniese
21 - Avi Rubin
22 - Fabian Monrose
23 - Andreas Terzis
24 - Ed Scheinerman
25 - Rai Winslow
26 - Misha Kazhdan
27 - Fred Jelinek
28 - Peter Froehlich
29 - Alex Szalay
30 - Peter Kazanzides
31 - Jerry Prince
32 - Rajesh Kumar
33 - John Griffin
34 - Rene Vidal
35 - Amitabh Mishra
36 - Emad Boctor
37 - Joel Bader













































spacerSearchContact UsIntegrity CodeAcademics FAQLibrary ResourcesJob Center