Notice：
-
03-14
2012
Exact and Approximate Shortest-Path Queries
Speaker: Christian Sommer MIT Time: 2012-03-14 10:40-2012-03-14 11:40 Venue: FIT 1-222 Abstract: We discuss the problem of efficiently computing a shortest path between two nodes of a network ...
-
03-12
2012
The computational complexity of mathematical proofs
Speaker: Phuong Nguyen University of Toronto Time: 2012-03-12 10:00-2012-03-12 11:00 Venue: FIT 1-222 Download: Click! Abstract: Mathematical proofs can be classified using the computational c...
-
03-08
2012
Supporting Efficient and Effective Keyword Search: From Set Intersection to Taxo
Speaker: Bolin Ding UIUC Time: 2012-03-08 10:00-2012-03-08 11:00 Venue: FIT 1-222 Download: Click! Abstract: This talk is about index and data model to support efficient and effective keyword ...
-
03-07
2012
The Approximability of NP-hard optimization problems
Speaker: Yi Wu IBM Alamaden Research Time: 2012-03-07 09:30-2012-03-07 10:30 Venue: FIT 1-222 Download: Click! Abstract: Optimization problems arise naturally in many applications of computer ...
-
03-07
2012
Optimal Control in Complex Networks
Speaker: Longbo Huang University of California, Berkeley Time: 2012-03-07 10:40-2012-03-07 11:40 Venue: FIT 1-222 Download: Click! Abstract: Networks have been one of the most common forms of ...
-
03-05
2012
Invigorating Console Logs: Logs as THE Debugging Tool for Large-scale Systems
Speaker: Wei Xu Google Time: 2012-03-05 10:00-2012-03-05 11:00 Venue: FIT 1-222 Download: Click! Abstract: Console logs are textual data that systems print, mostly for debugging purposes. Desp...