Computer Science Pizza Seminar

Department of Computer Science, University of Chicago

WHAT: The CS Pizza Seminar is a students-only seminar with free food (provided courtesy of the Computer Science Graduate Committee). Although intended mainly for graduate students, advanced undergraduates may also find it of interest, and are welcome to attend.

To get added to the mailing list, send email to Tim Armstrong at .

WHEN: Roughly every other Monday from 12:30-1:20. (The same time as the CS faculty meeting.)

WHERE: Ryerson 251 or Ryerson 255.

WHY:

Seminars

Winter Quarter, 2012

12 Mar 2012 Lars Bergstrom Giving a good job talk (3/3)
5 Mar 2012 Lars Bergstrom Giving a good job talk (2/3)
27 Feb 2012 Lars Bergstrom Giving a good job talk (1/3)

Winter Quarter, 2011

14 March 2011 Ross Girshick Human pose estimation from depth images: how the Xbox kinect sees

21 February 2011 Damon Wang Isosurfacing with Utmost Efficiency (in Python)

14 February 2011 Negar Mirsattari Properties of Degree Sequences of k-Uniform Hypergraphs

Fall Quarter, 2010

29 November 2010 Matthew Rocklin Perturbations on Nonlinear Dynamical Systems

8 November 2010 Borja Sotomayor Anatomy of a Dissertation

25 October 2010 Maia Fraser Decomposition of Hierarchically Derived Kernels

Spring Quarter, 2010

7 June 2010 Atilla Soner Balkir A Distributed Look-up Architecture for Text Mining Applications using MapReduce

17 May 2010 Josh Grochow NP does not reduce to sets of low information content

26 April 2010 Xueyuan Zhou Semi-Supervised Learning with the Graph Laplacian: The Limit of Infinite Unlabelled Data

12 April 2010 Maia Fraser Extending Face Routing

Winter Quarter, 2010

25 January 2010 Morgan Sonderegger Automatic discriminative measurement of voice onset time

8 February 2010 Raghav Kulkarni Evasiveness and the Distribution of Prime Numbers

15 March 2010 Josh Grochow Nondeterministic space is closed under complement: a complexity-theoretic gem

Winter Quarter, 2009

12 January 2009 Casey Klein Modeling and Testing in PLT Redex
2 February 2009 Joshua A. Grochow Network motifs, or: how I learned to stop worrying (about proofs) and love implementation
9 March 2009 Andy R. Terrel Scientific Computing in Python

Fall Quarter, 2008

27 October 2008 Ross Girshick Object Recognition with Deformable Part Models
10 November 2008 Ioan Raicu Cloud Computing and Grid Computing 360-Degree Compared
1 December 2008 Lars Bergstrom An Introduction to Programming on GPUs

Spring Quarter, 2008

15 April 2008 Lars Bergstrom On Interviews
28 April 2008 Eric Purdy Expander Graphs (A Gentle Introduction)
19 May 2008 Joshua A. Grochow Something every computer scientist should know: we only know of *one* NP-complete problem
9 June 2008 Adam Shaw ML Programming is More Fun than a Frog in a Glass of Milk

Winter Quarter, 2008

7 January 2008 Adam Shaw Compiling Manticore
21 January 2008 Peter Brune How to Solve PDEs Slowly and Quickly
4 February 2008 Raghav Kulkarni Deterministically Isolating a Matching in Bipartite Planar Graphs
18 February 2008 Borja Sotomayor A Gentle Introduction to Grid Computing (joint presentation with the U. Chicago chapter of the ACM)

Fall Quarter, 2007

29 Oct 2007 Sourav Chakraborty Multi-Unit Auctions with Unknown Supplies
5 Nov 2007 Leandro Cortes Tracking Hundreds of Nano-objects
12 Nov 2007 Andy R. Terrel Mathematical Interfaces of Automated Scientific Computing

Spring Quarter, 2007

2 Apr 2007 Varsha Dani Online Decision Making
30 Apr 2007 Ioan Raicu Falkon: a Fast and Light-weight tasK executiON framework for Grid Environments
14 May 2007 Sourav Chakraborty Testing Graph Isomorphism
21 May 2007 Aaron Turun (undergraduate) Metaprogramming With Traits

Winter Quarter, 2007

12 Feb 2007 Vikas Sindhwani Learning from Labeled and Unlabeled Examples
26 Feb 2007 Paolo Codenotti Reversing Sink Source Pairs in Multiple Unicast Network Coding
12 Mar 2007 Andy R. Terrel Finite Elements Revisited