Difference between revisions of "CATS"

From Theory
Line 25: Line 25:
 
| Nov 20|| 1:00-2:00 PM|| AVW 4424|| Saeed Seddighin ||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-20-2015 The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems]  
 
| Nov 20|| 1:00-2:00 PM|| AVW 4424|| Saeed Seddighin ||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-20-2015 The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems]  
 
|-
 
|-
| Dec 4 || 1:00-2:00 PM|| CSIC3118|| Sina Dehghani || TBA
+
| Dec 4 || 1:00-2:00 PM|| CSIC3118|| Sina Dehghani || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Dec-4-2015 Pricing the Cloud]
 
|-
 
|-
 
| Dec 11 || 1:00-2:00 PM|| CSIC3118|| Babis (MIT)  || TBA
 
| Dec 11 || 1:00-2:00 PM|| CSIC3118|| Babis (MIT)  || TBA

Revision as of 19:46, 7 December 2015

Capital Area Theory Seminar[edit]

Fall 2015[edit]

Date Time Location Speaker Title
Aug 3 11:00 AM-12:00 PM CSIC 1121 Joel Spencer Finding Needles in Exponential Haystacks
Sept 11 1:00-2:00 PM CSIC3118 Manish Purohit Approximation Algorithms for Connected Maximum Cut and Related Problems
Sept 25 1:00-2:00 PM CSIC3118 Karthik A Sankararaman Lassere Hierarchy
Oct 2 1:00-2:00 PM CSIC3118 Pan Xu Lassere Hierarchy
Oct 9 1:00-2:00 PM CSIC3118 Hossein Esfandiari Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
Oct 30 1:00-2:00 PM CSIC3118 Manish Purohit Two Faces of Algorithm Design: Optimization and Learning
Nov 6 1:00-2:00 PM CSIC3118 Khoa Trinh An Improved Approximation Algorithm for Knapsack Median
Nov 13 1:00-2:00 PM CSIC3118 Soheil Ehsani Online Degree-Bounded Steiner Network Design
Nov 20 1:00-2:00 PM AVW 4424 Saeed Seddighin The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems
Dec 4 1:00-2:00 PM CSIC3118 Sina Dehghani Pricing the Cloud
Dec 11 1:00-2:00 PM CSIC3118 Babis (MIT) TBA

CATS Talks from previous semesters[edit]