Notice：
-
06-24
2010
A Lower Bound for Cooperative Broadcast in the Presence of Noise
Speaker: Michael Saks Rutgers, The State University of New Jersey Time: 2010-06-24 14:00-2010-06-24 15:00 Venue: FIT 1-222 Abstract: In a noisy broadcast channel, processors communicate as fo...
-
06-10
2010
Mobile Social Networking without Big Brother
Speaker: Monica Lam Stanford University Time: 2010-06-10 16:00-2010-06-10 17:00 Venue: FIT 4-603 Abstract: Motivated to offer consumers an alternative to centralized social networking, we hav...
-
06-10
2010
Fairness and Partial Fairness in Secure Two-Party Computation
Speaker: Jonathan Katz University of Maryland Time: 2010-06-10 14:00-2010-06-10 15:00 Venue: FIT 4-603 Abstract: Protocols for secure two-party computation allow users holding inputs x and y, ...
-
05-27
2010
Technology on Measurement Information Processing in Wireless Sensor Networks
Speaker: Xue Wang Tsinghua University Time: 2010-05-27 14:00-2010-05-27 15:00 Venue: FIT 4-603 Abstract: Short Bio:
-
05-20
2010
A Theory of Cryptographic Complexity
Speaker: Manoj Prabhakaran University of Illinois, Urbana-Champaign Time: 2010-05-20 14:00-2010-05-20 15:00 Venue: FIT 1-222 Abstract: In this talk, I shall describe an ongoing project to deve...
-
04-23
2010
Blackwell Approachability meets Regret Minimization in the Dual
Speaker: Jacob Abernethy UC Berkeley Time: 2010-04-23 14:00-2010-04-23 15:00 Venue: FIT 1-222 Abstract: A result from the 1950's, Blackwell's Approachability Theorem, showed what was essentially a ...