Difference between revisions of "CATS-Fall-2013"

From Theory
(Created page with "== Fall 2013 == {| class="wikitable" style="text-align: center;" border="1" |- ! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Spe...")
 
 
Line 25: Line 25:
 
| Nov 22|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.umd.edu/~gasarch/ William Gasarch] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-22-2013 Pretty good, though still Exponential, algorithms for 3-SAT and Min Ind Set]  
 
| Nov 22|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.umd.edu/~gasarch/ William Gasarch] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-22-2013 Pretty good, though still Exponential, algorithms for 3-SAT and Min Ind Set]  
 
|}
 
|}
 +
 +
(*) Sponsored by CS Dept and Northrop Grumman.
 +
 +
(**) Supported in part by NSF CAREER award 1053605, NSF grant CCF-1161626, ONR YIP award N000141110662, DARPA/AFOSR grant FA9550-12-1-0423, and a grant from Simons Foundation.

Latest revision as of 21:46, 31 January 2014

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 Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
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 Concise Bid Optimization Strategies with Multiple Budget Constraints
Nov 22 1:00-2:00 PM CSIC1122 William Gasarch Pretty good, though still Exponential, algorithms for 3-SAT and Min Ind Set

(*) Sponsored by CS Dept and Northrop Grumman.

(**) Supported in part by NSF CAREER award 1053605, NSF grant CCF-1161626, ONR YIP award N000141110662, DARPA/AFOSR grant FA9550-12-1-0423, and a grant from Simons Foundation.

Web Accessibility

Retrieved from "https://wiki.cs.umd.edu/theory/w/index.php?title=CATS-Fall-2013&oldid=1806"