Scheduled Talks: Spring 2005

Following are announcements for talks scheduled for presentation by the Department of Computer Science. To subscribe or unsubscribe from the colloqium mailing list, use this page: http://www.cs.nyu.edu/mailman/listinfo/colloq For more information, please contact Jillian Kerlin (kerlin@cs.nyu.edu).

Date	Speaker/Affiliation	Details	Host
January 21, 2005	Frank Tip, IBM Research	Efficiently Refactoring Java Applications to Use Generic Libraries	Robert Grimm
January 28, 2005	Paolo Bientinesi , The University of Texas at Austin	Toward a Final Generation of Linear Algebra Libraries	Michael Overton
February 4, 2005	Andries van Dam , Brown University	Immersive Virtual Reality in Scientific Visualization	Demetri Terzopoulos
February 28, 2005	Lawrence Saul , UPenn	Statistics, Geometry, Computation: Searching for Low Dimensional Manifolds in High Dimensional Data	Yann LeCun
March 7, 2005	Nick Feamster, MIT	Robust Internet Routing	Richard Cole
March 9, 2005	Tong Zhang, IBM TJ Watson Research Center	A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data	Richard Cole
March 11, 2005	Alexander Gray, Stanford	Computational Foundations for Statistical Learning: Enabling Massive Science	Richard Cole
March 21, 2005	Sriram Sankaranarayanan, Stanford	Mathematical Analysis of Programs	Richard Cole
March 25, 2005	Aditya Akella, CMU	End Point-Based Routing Strategies for Improving Internet Performance	Richard Cole
March 28, 2005	Sumit Gulwani, UC Berkeley	Program Analysis using Random Interpretation	Richard Cole
April 1, 2005	Vibha Sazawal, Washington	Make Better Design Decisions As You Code	Richard Cole
April 4, 2005	David Blei, CMU	Probabilistic Models of Text and Images	Richard Cole
April 6, 2005	Sorin Lerner, Washington	Automatically Checking the Correctness of Program Analyses and Transformations	Richard Cole
April 8, 2005	Jinyang Li, MIT	Robust DHT Lookups with Accordion	Richard Cole
April 11, 2005	Lakshminarayan Subramanian, Berkeley	Decentralized security mechanisms for Internet routing	Richard Cole
April 13, 2005	Westley Weimer, Berkeley	Exceptional Situations and Program Reliability	Richard Cole
April 15, 2005	IBM Research/NYU/Columbia Theory Day	Theory Day	Yevgeniy Dodis
April 15, 2005	Ratul Mahajan, Washington	Efficient and Robust Routing in the Presence of Competing Interests	Richard Cole
April 20, 2005	Gert Lanckriet, Berkeley	Classification Problems With Heterogeneous Information	Richard Cole
April 22, 2005	Guy Lebanon, CMU	Riemannian Geometry and Text Classification	Richard Cole
April 27, 2005	Richard Bonneau, Institute for Systems Biology	The Human Proteome Folding Project and the Inferelator: Two Examples of Computational Systems Biology	Richard Cole
April 29, 2005	George Candea, Stanford	A Reboot-based Approach to High Availability	Richard Cole