Difference between revisions of "CATS"
From Theory
Line 15: | Line 15: | ||
| Oct 5 || 3:30-4:30 PM|| AVW3258|| [http://www.dcs.warwick.ac.uk/~harry/ Harald Räcke]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-05-2012 An $O(\log k)$-competitive Algorithm for Generalized Caching] | | Oct 5 || 3:30-4:30 PM|| AVW3258|| [http://www.dcs.warwick.ac.uk/~harry/ Harald Räcke]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-05-2012 An $O(\log k)$-competitive Algorithm for Generalized Caching] | ||
|- | |- | ||
− | | Oct 12|| 3:30-4:30 PM|| AVW3258|| [http://research.google.com/pubs/NitishKorula.html Nitish Korula]|| - | + | | Oct 12|| 3:30-4:30 PM|| AVW3258|| [http://research.google.com/pubs/NitishKorula.html Nitish Korula]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-12-2012 Bicriteria Online Matching: Maximizing Weight and Cardinality] |
|- | |- | ||
| Oct 19|| 1:00-2:00 PM|| CSIC2117|| [http://www.cs.sfu.ca/~cenk/ S. Cenk Sahinalp] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-19-2012 Efficient communication and storage vs accurate variant calls in high throughput sequencing: two sides of the same coin] (joint with Colloquium Series) | | Oct 19|| 1:00-2:00 PM|| CSIC2117|| [http://www.cs.sfu.ca/~cenk/ S. Cenk Sahinalp] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-19-2012 Efficient communication and storage vs accurate variant calls in high throughput sequencing: two sides of the same coin] (joint with Colloquium Series) |
Revision as of 17:29, 9 October 2012
Capital Area Theory Seminar[edit]
Fall 2012[edit]
CATS Talks from previous semesters[edit]
- Spring 2012
- Spring 2011 Fall 2011
- Spring 2010 Fall 2010
- Spring 2009
- Spring 2008 Fall 2008
- Spring 2007 Fall 2007
- Spring 2006 Fall 2006
- Spring 2005 Fall 2005
- Spring 2004 Fall 2004
- Spring 2003 Fall 2003
- Spring 2002 Fall 2002
- Fall 2001
- Spring 2000 Fall 2000
- Spring 1999 Fall 1999
- Spring 1998 Fall 1998
- Spring 1997 Fall 1997
- Spring 1996 Summer 1996 Fall 1996
- Fall 1995