CGL Meeting Agenda - 2000.05.31

May 31st, 2000


Location:
DC1304
Time:
1:30 p.m.
Chair:
Selina Siu ??? :-)

Member List

1. Adoption of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour last week:
Jasmin Patry
Coffee hour this week:
Selina Siu
Coffee hour next week:
???

3. Next meeting

Date:
Wednesday, June 7th, 2000
Location:
DC1304
Time:
1:30 p.m.
Chair:
Mauro Steigleder:-)
Technical presentation:
Chris O'Sullivan :-(

4. Forthcoming

Chair:
  1. Daming Yao (June 14th) :-)
  2. Mark Zadel (June 21st) :-)
  3. Shalini Aggarwal (June 28st) :-)
Tech Presenters:
  1. Selina Siu (June 14th) :-)
  2. Mauro Steigleder (June 21st) :-)
  3. Daming Yao (June 28th) :-)

5. Technical Presentation

Presenter:

Kevin Moule :-(

Title:

Klee's Measure Problem

Abstract:

In 1977, Victor Klee posed the following problem. Given a set of intervals on the real line compute the length of their union. An optimal solution to this problem was easily constructed. This problem is readily extended into higher dimensions for which tight upper and lower bounds are not known.

I will be giving an overview of the history of the problem, descriptions of the algorithms I implemented for my CS760M project and the results from the project.

6. General Discussion Items

7. Action List

8. Director's Meeting

9. Seminars

Wednesday, 31 May 2000, 2:30PM - Computer Science (Algorithms and Complexity Group), DC1331
Venkatesh Raman: -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties
 
Thursday, 1 June 2000, 11:00AM - Computer Science , DC 1331
Quang Ngoc Tran: -- An Electronic Commerce Model for Small Businesses in the Waterloo Information Network''
 
Thursday, 1 June 2000, 3:30PM - Statistics & Actuarial Science , Math & Computer, Room 5158
Prof. Shane Henderson: -- Yacht Match Race Simulation and the Americas Cup
 
Friday, 2 June 2000, 3:30PM - Combinatorics and Optimization , Math & Computer, Room 5158
Prof. Levent Tuncel: -- Tutte Colloquium - Complexity Measures for Linear Optimization and Generalizations of Tardos' Theorem

10. Lab Cleanup