BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium : An Approximation Perspective on Algorithms
DTSTART:20141006T161500
DTEND:20141006T173000
DTSTAMP:20260408T063619Z
UID:03743ef81defd2874fb2284ed1558fae48b37a06658a0f48365198dd
CATEGORIES:Conferences - Seminars
DESCRIPTION:By : Moses Charikar - Princeton UniversityVideo of his talkAbs
 tract :\nFaced with hard optimization problems where polynomial time exact
  algorithms are unlikely to be found\, theoretical computer scientists hav
 e focussed on the development of efficient heuristics with provable guaran
 tees. This pursuit of such approximation algorithms has led to a rich body
  of tools and techniques. In this talk\, I will argue that this approximat
 ion perspective is a useful way to approach algorithm design and the resul
 ting ideas are more broadly applicable beyond the field of approximation. 
 I will illustrate this thesis via a few vignettes drawn from my own work o
 n compact data representation\, network design\, information aggregation a
 nd tensor decomposition.Bio :\nMoses Charikar is a professor of Computer S
 cience at Princeton University. He obtained his PhD from Stanford Universi
 ty in 2000\, spent a year in the research group at Google and has been at 
 Princeton since 2001. He is broadly interested in the design and analysis 
 of algorithms with an emphasis on approximation algorithms for hard proble
 ms\, metric embeddings and algorithmic techniques for big data. His work o
 n dimension reduction won the best paper award at FOCS 2003. He was awarde
 d the 2012 Paris Kanellakis Theory and Practice Award for his work on loca
 lity sensitive hashing\, and was recently named a Simons Investigator in t
 heoretical computer science.More information
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR