Auto-reminder: Upcoming CS Event(s): Weekly Digest
csweb...@usc.edu
Iterative Methods in Combinatorial Optimization by Mohit Singh
/*Time and Date*/
3:30:00 PM on 2/22/2011
/*Location*/
SSL 150
/*Details*/
Speaker: Mohit Singh, McGill University
Host: Prof. David Kempe
Abstract:
Many fundamental combinatorial optimization problems including minimum spanning tree, matchings, flows are polynomial time solvable but most problems that arise in practice turn out to be NP-hard. Fortunately, many NP-hard problems can be modeled by introducing extra side constraints in some fundamental optimization problem. A natural question to ask is whether we can extend any techniques for solving simple combina...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1189
-----------------------------------------------------------------------
/*Event*/
Analysis Techniques for Mobile Operating System Security by William Enck (Faculty Candidate)
/*Time and Date*/
3:30:00 PM on 2/24/2011
/*Location*/
SSL 150
/*Details*/
Speaker: William Enck
Host: Prof. William Halfond
Abstract:
Over the last several years, smartphone application markets such as Google's Android Market and Apple's App Store have become a thriving industry with simplified distribution and little barrier to entry for developers. Smartphone users face many security and privacy risks, the most wide-spread of which results from applications operating within the confines of existing operating system protections. In this talk, I will discuss h...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1188
-----------------------------------------------------------------------
AUTO-REMINDER of CS EVENTS:
CS Faculty, Student and Staff email lists automatically receive email reminders of CS events. Other members of USC community can place subscription request by sending email to csIT...@usc.edu.
To have your events added to the CS Calendar, please send details to CS Front Desk (frnt...@cs.usc.edu).
http://www.cs.usc.edu/Calendar/
----------
csweb...@usc.edu
Limits of Communication by Sasha Sherstov (Faculty Candidate)
/*Time and Date*/
3:30:00 PM on 2/28/2011
/*Location*/
SAL 101
/*Details*/
Speaker: Alexander Sherstov (Microsoft Research)
Host: Prof. Ming-Deh Huang
Abstract:
Consider a function f whose arguments are distributed among several parties, making it impossible for any one party to compute f in isolation. Initiated in 1979, communication complexity theory studies how many bits of communication are needed to evaluate f. I will prove that:
1. some natural and practical problems require high communication to achieve any advantage at all over random guessing;
2. so...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1208
-----------------------------------------------------------------------
/*Event*/
Differential Privacy: Recent Developments and Future Challenges by Guy Rothblum, Princeton University (Faculty Candidate)
/*Time and Date*/
3:30:00 PM on 3/1/2011
/*Location*/
SSL 150
/*Details*/
Speaker: Guy Rothblum, Princeton University
Host: Prof. Ming-Deh Huang
Abstract:
Consider a database of sensitive information about a set of participants. Statistical analysis of the data may yield valuable results, but it also poses serious threats to the participants' privacy. A successful research program has, in the last few years, attempted to address these conflicting concerns, formulating the rigorous privacy guarantee of differential privacy [Dwork McSherry Nissim and Smith '06] ...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1206
-----------------------------------------------------------------------
/*Event*/
Towards Reliable Storage Systems by Haryadi Gunawi, UC Berkeley (Faculty Candidate)
/*Time and Date*/
3:30:00 PM on 3/3/2011
/*Location*/
SSL 150
/*Details*/
Speaker: Haryadi Gunawi, UC Berkeley
Host: Prof. Ramesh Govindan, USC
Abstract:
Three trends will dominate the storage systems of tomorrow: increasingly massive amounts of data, the incredible growth of software complexity, and the increasing use of cheap and less reliable hardware. These trends present us with a huge challenge: How can we promise users that storage systems work robustly in spite of their massive software complexity and the broad range of hardware failures that can aris...read more at event URL-
http://www.cs.usc.edu/calendar/csevent.asp?Event_ID=1195