BEGIN:VCALENDAR
VERSION:2.0
X-WR-CALNAME;VALUE=TEXT:Charalampos (Babis) Tsourakakis: "Algorithm Design for Large-Scale Datasets"
PRODID:-//Harvard events data//EN
BEGIN:VEVENT
UID:event_252836_0
SUMMARY:Charalampos (Babis) Tsourakakis: "Algorithm Design for Large-Scale Datasets"
DESCRIPTION:<p><strong>CRCS Lunch Seminar</strong></p><p><strong>Date:</strong> Monday, November 17th, 2014<br><strong>Time:</strong> 11:30am – 1:00pm<br><strong>Place:</strong> 33 Oxford St., Maxwell Dworkin 119</p><p><strong>Speaker:</strong> CRCS Fellow Charalampos (Babis) Tsourakakis</p><p><strong style="font-size: initial;">Title: </strong>"Algorithm Design for Large-Scale Datasets"</p><p><strong><drupal-media data-entity-type="media" data-entity-uuid="7300169b-b4fa-438e-a916-05432daf7941"></drupal-media></strong></p><p><strong>Abstract:<br></strong></p><div>In this talk we will focus on efficient algorithm design, a central challenge posed by the big data phenomenon.In the first part of the talk we will present an efficient approach to extracting dense subgraphs from large-scale networks, </div><div>a key primitive for many graph mining applications.</div><div></div><div>In the second part, we will focus on dynamic programming, a problem solving technique used in a plethora of important applications.  We will provide two novel techniques for optimizing dynamic programming that can handle </div><div>cost functions not treated by other standard methods. We show an application in the context of fitting piecewise constant segments to a one-dimensional signal, an optimization problem which appears under different guises in databases and data mining.  </div><p></p><p></p><p><strong>Biography:</strong></p><div><drupal-media data-entity-type="media" data-entity-uuid="11d3dc67-ac69-41ca-9be4-270dcc30e909" data-align="right"></drupal-media>Dr. Charalampos Tsourakakis is currently a Postdoctoral Fellow in Harvard University. </div><div>He received his Ph.D. from the Algorithms, Combinatorics and Optimization (ACO)</div><div>program at Carnegie Mellon University. </div><div>He holds a Diploma in Electrical and Diploma Engineering from the National </div><div>Technical University of Athens and a Master of Science from the Machine </div><div>Learning Department at Carnegie Mellon University. </div><div>He won a best paper award in IEEE Data Mining, has delivered two tutorials in </div><div>the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, </div><div>and has designed two graph mining libraries for tera-scale graphs, </div><div>one of which has been officially included in Windows Azure. </div><div>His research interests include algorithmic graph theory, </div><div>random graph theory, and graph-related applications with a focus on large-scale networks. </div>
LOCATION:Maxwell Dworkin 119
STATUS:CONFIRMED
DTSTART:20141117T163000Z
DTEND:20141117T180000Z
END:VEVENT
END:VCALENDAR