Department Events


[ View Current Schedule ] Archives: [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [2003] [2002] [2001] [1998]

Wednesday, November 19, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Maria Klawe
The Aphasia Project: Designing Technology for and with People who have Aphasia
Joanna McGrenere, University of British Columbia
[view abstract].

Wednesday, November 5, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Thomas Funkhouser
3D Scanning in Egypt and Image-based Object Editing
Holly Rushmeier, IBM TJ Watson Research Laboratory
[view abstract].


Please see this link for more information.


Wednesday, October 15, 2003, 4:00 PM - 5:30 PM
Distinguished Lecture Series
Computer Science Small Auditorium (Room 105)
Host: Kai Li
MyLifeBits: A Project to Implement Memex
Gordon Bell, Microsoft
[view abstract].

Monday, October 13, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Andrew Appel
Computers and the Sociology of Mathematical Proof
Donald MacKenzie, University of Edinburgh
[view abstract].

Wednesday, October 8, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Sanjeev Arora
Adiabatic quantum algorithms
Umesh Vazirani, UC Berkeley
[view abstract].


Please see this link for more information.


Monday, April 21, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Thomas Funkhouser
Statistical Analysis of Anatomical Shape and Function
Polina Golland, MIT AI Lab
[view abstract].

Monday, April 14, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Kenneth Steiglitz
Computer Science and Game Theory: Mutual Influences and Synergies
Kevin Leyton-Brown, Stanford University
[view abstract].


Please see this link for more information.


Wednesday, April 9, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Mona Singh
Genes,Tumors, and Bayes nets: Improving the specificity of biological signal detection in microarray analysis.
Olga Troyanskaya, Stanford
[view abstract].

Monday, March 31, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Robert Schapire
Multiagent Learning in the Presence of Limited Agents
Michael Bowling, Carnegie Mellon University
[view abstract].


Please see this link for more information.


Wednesday, March 26, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Amit Sahai
Efficiency in Online and Noise-Tolerant Learning
Adam Kalai, MIT
[view abstract].


Please see this link for more information.


Wednesday, March 12, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Robert Schapire
Multiagent Planning with Factored MDPs
Carlos Guestrin, Stanford University
[view abstract].


Please see this link for more information.


Wednesday, March 5, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Vivek Pai
Neptune: Programming and Runtime Support for Cluster-based Network Services
Tao Yang, UCSB/Teoma
[view abstract].


Please see this link for more information.


Monday, March 3, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Thomas Funkhouser
Art, Math, and Sculpture
Carlo H. Séquin, UC Berkeley
[view abstract].


Please see this link for more information.


Wednesday, February 26, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Douglas Clark
An Empirical Approach to Computer Vision
David Martin, University of California - Berkeley
[view abstract].

Wednesday, February 19, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Brian Kernighan
Computer Vision and Control for Soccer Robots - The FU Fighters Team
Raul Rojas, University of Pennsylvania and Freie Universitaet Berlin
[view abstract].


Please see this link for more information.


Thursday, February 13, 2003, 12:30 PM - 2:00 PM
Seminar
Friend Center 013
Host: Andrew Appel
An Infrastructure for Compilers and Programming Tools
David Tarditi, Microsoft Research

Microsoft is building a next-generation compiler infrastructure that will be the basis for Microsoft's product compilers and other programming tools and a research platform as well. This project, code-named Phoenix, is a joint effort between the Developer Platforms Division and Microsoft Research. The general idea is to build a set of compiler building blocks that are unified using a common intermediate representation. The blocks will be composed to derive various compiler configurations and to support programming tools. The challenge is to span a range of input languages, target architectures, compiler configurations and to produce a useful research platform. We have assembled a team with experience in these different areas. In this talk, I'll give a high-level overview of the project, discussing goals, input languages, target architectures, compilation models, ideas for making it available as a research platform, and progress to date. The intermediate representation is still a work-in-progress, so I will only be giving a general overview of it. I will also discuss some research topics that my group plans to investigate using Phoenix as a research platform.

Monday, February 10, 2003, 4:30 PM - 6:00 PM
Seminar
Computer Science Small Auditorium (Room 105)
Host: Kai Li
Not Available (click for abstract)
Chandu Thekkath, Microsoft Research

This talk will describe the goals, design, and current status of two projects named Boxwood and Koh-i-Noor that are in progress at Microsoft Research in Silicon Valley.

Boxwood is exploring the design and implementation of persistent, distributed, and fault-tolerant B-Trees. The goal of the project is to provide a high-performance and scalable "B-Tree Service" that is, in turn, used as the underlying substrate by clients such as distributed file systems and distributed data bases. The service is implemented as a cooperating set of CPUs with locally attached storage interconnected by a high speed network. Providing such a service is an interesting challenge in the presence of failures, load imbalances, and concurrency.

Koh-i-Noor is exploring the use of erasure codes to build reliable disk subsystems that tolerate several disk failures before data loss. Unlike mirroring or triplexing, which double or triple the number of disks required to store data, erasure codes can be very cost-effective in providing equivalent (or higher) reliability. Some of the key challenges we have addressed involve getting good read/write performance in the normal case as well as when data is being reconstructed after a failure.


Wednesday, February 5, 2003, 4:00 PM - 5:30 PM
Colloquium
Computer Science Small Auditorium (Room 105)
Host: Vivek Pai
Logistical Networking and the Network Storage Stack
James S. Plank, University of Tennessee
[view abstract].