Computer Science Colloquium, 2007-2008

For more information, including directions, refer to the colloquium homepage. Click on a title to see the abstract.

List of Talks

• Wednesday, November 26, 14:00 (special day and time):
  Shai Avidan, Adobe.
  Seam Carving for Content-Aware Image Resizing
• Wednesday, December 5, 14:00:
  Olga Troyanskaya, Princeton.
  Computational methods for extracting knoledge from genomics data: from yeast to mammals
• Wednesday, December 19, 14:00:
  Liad Blumrosen, Microsoft.
  Can simple markets achieve good results?
• Wednesday, December 26, 14:00:
  Guy Kindler, Weizmann Institute.
  Understanding parallel repetition requires understanding foams
• Wednesday, January 2, 14:00:
  Koby Crammer, University of Pennsylvania.
  Learning From Related Sources
• Tuesday, January 8, 12:00: (note the special day and location!)
  Tali Kaufman, MIT.
  Sufficient conditions for local-to-global computations
  This talk will be held in room 570, Education building (CRI)
• Wednesday, January 9, 14:00:
  Danny Gutfreund, MIT.
  Worst-case complexity vs. average-case complexity
• Wednesday, February 13, 14:00: (note the special location!)
  Bruce Richmond, University of Waterloo.
  Random maps
  This talk will be held in room 570, Education building (CRI)
• Wednesday, February 13, 15:10: (note the special location and time!)
  Muthu Muthukrishnan, Google Research
  Algorithmic Issues in Sponsored Search
  This talk will be held in room 570, Education building (CRI)
• Wednesday, February 27, 14:00:
  Lihi Zelnik, Technion.
  Recognizing image segmentation
• Wednesday, April 2, 14:00:
  Yair Moshe, University of Haifa.
  Fast Block Motion Estimation Using Gray Code Kernels
• Wednesday, April 9, 14:00:
  Danny Vilenchik, Tel Aviv University.
  On satisfiable k-CNF formulas above the threshold
• Wednesday, May 14, 14:00:
  Moshe Vardi, Rice University.
  From Philosophical to Industrial Logics
  This talk will be held in room 570, Education building (CRI)
• Wednesday, July 9, 14:00:
  Gil Zussman, Columbia University.
  Throughput Maximization in Wireless Networks via Partitioning and Randomization
• Wednesday, July 16, 14:00:
  Iddo Lev.
  Packed Computation of Exact Meaning Representations