Processing Math: Done
jsMath
Differences between revisions 14 and 17 (spanning 3 versions)
⇤ ← Revision 14 as of 2007-05-25 00:32:29 →
Size: 658
Editor: wstein
Comment:
← Revision 17 as of 2007-05-25 17:14:21 → ⇥
Size: 906
Editor: wstein
Comment:
Deletions are marked like this. Additions are marked like this.
Line 5: Line 5:
9-12: (optional) early-bird coffee, bagels, etc.

12-1 lunch at a designated restaurant

1:30 - 2:30 talk on improvements made to SAGE

3:00 - 4:00 talk on what SAGE needs in order to improve

4:30 - 5:00 strategy session

5:00 - 7:00 coding sprints

7:00 - 9:00 dinner

9:00 - very late: coding sprints		  * 9-12: (optional) early-bird coffee, bagels, etc.
 * 12-1 lunch at a designated restaurant
 * 1:30 - 2:30 talk on improvements made to SAGE
 * 3:00 - 4:00 talk on what SAGE needs in order to improve
 * 4:30 - 5:00 strategy session
 * 5:00 - 7:00 coding sprints
 * 7:00 - 9:00 dinner
 * 9:00 - very late: coding sprints
Line 23: Line 16:
 * Sarah Billey (TBA)

 * Charles Doran (June 17 at 11am)

 * Randy Leveque (TBA)

 * Jim Morrow

 * Paul Beame (June 16 at 3pm): ''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.''		  * Sarah Billey (UW Math): TBA
 * Henry Cohn (Microsoft Research, June 13): TBA
 * Charles Doran (UW Math, June 17 at 11am)
 * Randy Leveque (UW Applied Math): TBA
 * Jim Morrow (UW Math): Graph theory and electrical networks.
 * Paul Beame (UW Computer Science, June 16 at 3pm): ''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.''
 * Carl Witty (Newton Research Labs, June 16): '''Fast real root isolation''' (tentative)

Daily schedule

Schedule for [:days4: SAGE Days 4].

  • 9-12: (optional) early-bird coffee, bagels, etc.
  • 12-1 lunch at a designated restaurant
  • 1:30 - 2:30 talk on improvements made to SAGE
  • 3:00 - 4:00 talk on what SAGE needs in order to improve
  • 4:30 - 5:00 strategy session
  • 5:00 - 7:00 coding sprints
  • 7:00 - 9:00 dinner
  • 9:00 - very late: coding sprints

Talks

  • Sarah Billey (UW Math): TBA
  • Henry Cohn (Microsoft Research, June 13): TBA
  • Charles Doran (UW Math, June 17 at 11am)
  • Randy Leveque (UW Applied Math): TBA
  • Jim Morrow (UW Math): Graph theory and electrical networks.

  • Paul Beame (UW Computer Science, June 16 at 3pm): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.

  • Carl Witty (Newton Research Labs, June 16): Fast real root isolation (tentative)

days4schedule (last edited 2008-11-14 13:42:10 by anonymous)