-
03-29
2006
Pseudo randomness and Combinatorial Constructions
Speaker: Luca Trevisan UC Berkeley Time: 2006-03-29 14:00-2006-03-29 15:00 Venue: FIT Building, Tsinghua University Abstract: In combinatorics, the probabilistic method is a very powerful tool to p...
-
03-21
2006
Search via Quantum Walks
Speaker: Ashwin Nayak University of Waterloo, and Perimeter Institute for Theoretical Physics Time: 2006-03-21 14:30-2006-03-21 14:30 Venue: FIT-1-222 Abstract: Randomization of quantum states is ...
-
03-20
2006
Stochastic Optimization is (almost) as Easy as Deterministic Optimization
Speaker: David Shmoys Cornell University Time: 2006-03-20 14:00-2006-03-20 15:00 Venue: FIT Building, Tsinghua University Abstract: Stochastic optimization problems attempt to model uncertainty in ...
-
03-17
2006
Approximation Algorithms for the k-Facility Location Problem
Speaker: Peng Zhang Institute of Software, Chinese Academy of Sciences Time: 2006-03-17 14:00-2006-03-17 15:00 Venue: FIT Building,Tsinghua University Abstract: Short Bio:
-
03-08
2006
I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis
Speaker: Ke Yi Duke University (now at AT & T Research Labs) Time: 2006-03-08 14:00-2006-03-08 15:00 Venue: FIT Building, Tsinghua University Abstract: As the massive data sets we face today far ex...
-
02-24
2006
Network Games and the Price of Anarchy or Stability
Speaker: Eva Tardos Cornell University Time: 2006-02-24 13:00-2006-02-24 14:00 Venue: FIT-1-222 Abstract: Traditional network design assumes that the network designer has the information and power ...