Difference between revisions of "CATS"

From Theory
Line 18: Line 18:
 
| Oct 11|| 1:00-2:00 PM|| CSIC1122|| [http://ect.bell-labs.com/who/dmandrews/ Matthew Andrews] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-11-2013 Economics of Sponsored Content in Mobile Data Networks under Uncertain Demand]  
 
| Oct 11|| 1:00-2:00 PM|| CSIC1122|| [http://ect.bell-labs.com/who/dmandrews/ Matthew Andrews] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-11-2013 Economics of Sponsored Content in Mobile Data Networks under Uncertain Demand]  
 
|-
 
|-
| Oct 25|| 1:00-2:00 PM|| CSIC1122|| Anshul Sawant || [to be announced]  
+
| Oct 25|| 1:00-2:00 PM|| CSIC1122|| Anshul Sawant || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-25-2013 Scheduling a Cascade with Opposing Influences]  
 
|-
 
|-
 
| Nov 1|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.princeton.edu/~zhenming/ Zhenming Liu] || [to be announced]  
 
| Nov 1|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.princeton.edu/~zhenming/ Zhenming Liu] || [to be announced]  

Revision as of 18:00, 21 October 2013

Capital Area Theory Seminar[edit]

Fall 2013[edit]

Date Time Location Speaker Title
Sep 17 1:00-2:00 PM AVW3258 Maria-Florina Balcan The Power of Localization for Active and Passive Learning of Linear Separators
Sep 20 1:00-2:00 PM CSIC1122 Yingyu Liang Clustering under Perturbation Resilience
Sep 27 1:00-2:00 PM CSIC1122 Rajesh Chitnis List H-Coloring a Graph by Removing Few Vertices
Oct 4 1:00-2:00 PM CSIC1122 Kamal Jain Algorithmic Game Theory of eBay's Buyer-Selling matching
Oct 11 1:00-2:00 PM CSIC1122 Matthew Andrews Economics of Sponsored Content in Mobile Data Networks under Uncertain Demand
Oct 25 1:00-2:00 PM CSIC1122 Anshul Sawant Scheduling a Cascade with Opposing Influences
Nov 1 1:00-2:00 PM CSIC1122 Zhenming Liu [to be announced]
Nov 8 1:00-2:00 PM CSIC1122 David Harris [Partial Resampling in the Moser-Tardos Framework]
Nov 15 1:00-2:00 PM CSIC1122 Mohammad Hossein Bateni [to be announced]
Nov 22 1:00-2:00 PM CSIC1122 William Gasarch Pretty good, though still Exponetial, algorithms for 3-SAT and Min Ind Set

Summer 2013[edit]

Date Time Location Speaker Title
Aug 2 1:00-2:00 PM AVW4172 Hubert Chan Revisiting the Ranking Algorithm for Greedy Randomized Matching on Arbitrary Graphs

CATS Talks from previous semesters[edit]