|
Winter
Term 2001-2002
CS
Thursday,
March 28, 4:00 pm
Automated
Decision Procedures: A General-Purpose Verification Solution
Clark Barrett,
Stanford University
080 Moore
CS
Monday,
March 25, 4:00 pm
Anonymous
Credentials
Anna Lysyanskaya, MIT
070 Moore
Information Sciences Seminar
Wednesday,
March 20, 4:00 pm
Algorithmic
Design of Complex Systems
Bradley Kuszmaul,
Akamai Technolgies and Yale University
74 Jorgensen
Information Sciences Seminar
Monday,
March 18, 4:00 pm
Computing
very good approximate solutions to traveling salesman and other
geometric NP-hard problems: A survey
Sanjeev
Arora,
Princeton University
070
Moore
Information Sciences Seminar
Wednesday,
March 14, 4:00 pm
Designing Networks with Uncertainty in Demands
Anupam Gupta, Lucent Bell Labs
74 Jorgensen
Information Sciences Seminar
Wednesday,
March 13, 4:00 pm
Approximation Algorithms and Games on Networks
Eva Tardos,
Cornell
080 Moore
CS
Friday, March 8, 4:00 pm
SEDA: An Architecture for Well-Conditioned, Scalable Internet
Services
Matt Welsh, UC Berkeley Computer Science Division
74 Jorgensen
CS
Friday, March 8, 4:00 pm
Variational
Subdivision (Part 1 of 2)
Peter Schröeder, Caltech
125 Steele
Information Sciences Seminar
Wednesday,
March 6, 4:00 pm
A
New Look at the Generalized Distributive Law
Venkat Anantharam,
Berkeley
080 Moore
Information Sciences Seminar
Wednesday,
February 27, 4:00 pm
Tackling
the Fast Fading Multipath Channel in Multiuser Systems
Urbashi Mitra,
USC
080 Moore
CS
Monday, February 25, 4:00 pm
Automatic
Tools for Building Secure Systems
Dawn Song,
UC Berkeley
142
Keck
CS
Friday, February 22, 1:30-3:00 pm
Intrinsic
Parameterizations
Mathieu Desbrun, USC/Caltech
125
Steele
|
CS
Thursday, February 21, 4:00 pm
Derandominzation:
Constructions and Applications
Chris Umans, Microsoft Research
102
Steele
Information Sciences Seminar
Wednesday,
February 20, 4:00 pm
How
to Scale
Lixia
Zhang, Caltech
080 Moore
Information Sciences Seminar
Tuesday,
February 19, 4:30 pm
Decomposition
Methods for Markov Chain Analysis
Dana Randall,
Georgia Institute of Technology
070 Moore
CS
Thursday, February 14, 4:00 pm
On Stabilizing Receding Horizon Controls for Linear Systems
Ki Baek Kim, Caltech
125 Steele
CS
Thursday, February 14, 4:00 pm
Quantum Interactive Proofs
Alexei Kitaev, Caltech
102 Steele
Information Sciences Seminar
Wednesday,
February 13, 4:00 pm
Dispersed Information Storage for Performance and Reliability
Andrew Jiang,
Caltech
080 Moore
Information Sciences Seminar
Wednesday,
February 6, 4:00 pm
Analog Codes for Improving the Information Density of Magnetic
Data Storage
Saleem Mukhtar, Caltech
080 Moore
CS
Wednesday, January 30, 3:00 pm
Gathering Knowledge from Large-Scale Scientific Data Sets
Tina Eliassi-Rad,
Center for Applied Scientific Computing, Lawrence Livermore National
Laboratory
74 Jorgensen
Information Sciences Seminar
Wednesday,
January 30, 4:00 pm
Computational PDEs for Visual Computing of Natural Phenomena:
Water, Smoke, Fire, Cloth
Ron Fedkiw,
Stanford
080 Moore
Information Sciences Seminar
Wednesday,
January 23, 4:00 pm
Connections Between Information and Queueing Theories
Balaji Prabhakar, Stanford
080 Moore
Information Sciences Seminar
Wednesday,
January 16, 4:00 pm
Probabilistic Inference and Free Energy Minimization
Bob McEliece,
Caltech
080 Moore
Information Sciences Seminar
Wednesday,
January 9, 4:00 pm
End-to-End
Congestion Control and Differentiated Services
Frank Kelly,
Cambridge/Stanford
080 Moore
|
