LAMPS OF ALADDIN ANNUAL PROJECT REVIEW
Wednesday, May 11, 2005
10:00 am – 5:00 pm
Newell Simon Hall 3305
You are invited to attend any sessions of interest during this day-long workshop in which students will present their recent research results or outline ongoing work. The primary purpose of this review is to inform other students and faculty of research that is going on as part of ALADDIN and associated projects. The talks will be conference length (about 20 minutes) and aimed for a general theory audience. We plan to have enough time to include ample discussion.
Agenda and Abstracts: http://www.aladdin.cs.cmu.edu/workshops/lamps05/index.html
More Information: Susan Hrishenko, x8-7317, susan027 @ cs dot cmu dot edu
TENTATIVE SCHEDULE – Wednesday, May 11, 2005
10:00 COFFEE
10:20 Adam Wierman
Classifying scheduling policies with respect to higher moments of conditional response time.
10:45 Nina Balcan
A Theoretical Model for Learning from Labeled and Unlabeled Data
11:10 Daniel Golovin, Carnegie Mellon University
TBD
11:35 Hubert Chan
Metric Embeddings with Relaxed Guarantees
12:00 LUNCH
1:30 Srinath Sridhar, Carnegie Mellon University
A Faster Reconstruction of Binary Near-Perfect Phylogenetic Trees
1:55 Kedar Dhamdhere, Carnegie Mellon University
On Stochastic Minimum Spanning Tree
2:20 Viswanath Nagarajan, Carnegie Mellon University
TBD
2:45 Vineet Goyal, Carnegie Mellon University
On the Minimum Crossing Spanning Tree
3:10 BREAK
3:30 Roy Liu, Carnegie Mellon University
Peekaboom: A Game for Locating Objects in Images
3:55 Todd Phillips, Carnegie Mellon University
Moving Mesh Adaptation Techniques
4:20 Yiannis Koutis, Carnegie Mellon University
Combinatorial and Algebraic Tools for Multigrid
4:45 Discussion
Ideas for Future PROBEs
5:00 END
