Notice：
-
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 ...
-
11-23
2005
The Mathematical Theory of Resource Allocation in Communication Networks: Part I
Speaker: Edmund Yeh Yale University, USA Time: 2005-11-23 14:00-2005-11-23 14:00 Venue: FIT-1-204 Abstract: The dramatic growth in world-wide demand for communication services has highlighted the ...
-
11-18
2005
MEET THE MASTER—Prof John Hopcroft, Turing Winner
Speaker: John Hopcroft Cornell University Time: 2005-11-18 15:30-2005-11-18 16:30 Venue: FIT-1-222 Abstract: Short Bio: John E. Hopcroft is the IBM Professor of Engineering and Applied mathematic...
-
11-16
2005
Quadratic Lower Bounds on Matrix Rigidity
Speaker: Satya Lokam Microsoft Research Time: 2005-11-16 10:30-2005-11-16 11:30 Venue: FIT-1-222 Abstract: The rigidity of a matrix $A$ with respect to the rank bound $r$ is the minimum number of e...