-
12-23
2004
Four All-Pairs Shortest Paths algorithms
演讲人： Uri Zwick Tel Aviv University 时间： 2004-12-23 14:30-2004-12-23 15:30 地点：FIT-1-222 内容： Four recent algorithms for various versions of the celebrated All-Pairs Shortest Paths problem w...
-
12-23
2004
On the Complexity of Finding Shortest Paths in a Two-Dimensional Domain
演讲人： Ker-I Ko State University of New York at Stony Brook 时间： 2004-12-23 14:30-2004-12-23 15:30 地点：FIT-1-315 内容： This talk consists of two parts. In the first part, we present an overvie...
-
12-20
2004
Computing the Arrow-Debreu Competitive Market Equilibrium
演讲人： Yinyu Ye Stanford University 时间： 2004-12-20 14:30-2004-12-20 15:30 地点：FIT-1-222 内容： We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu comp...
-
11-01
2004
Networking Going Postal
演讲人： Randy Wang Princeton University 时间： 2004-11-01 14:30-2004-11-01 15:30 地点：FIT-1-415 内容： Making high-bandwidth Internet access pervasively available to a large world-wide audience is ...
-
10-25
2004
The Analytic Techniques for MDx Hash Functions
演讲人： Xiaoyun Wang Shandong University 时间： 2004-10-25 14:30-2004-10-25 15:30 地点：FIT-1-315 内容： The talk describe the main analytic techniques for the broken hash functions-MD4,RIPEMD, MD5....
-
10-13
2004
Design by Building up and Breaking through Abstractions
演讲人： Yanhong Annie Liu State University of New York at Stony Brook 时间： 2004-10-13 14:30-2004-10-13 16:00 地点：FIT-1-415 内容： Software design must resolve the conflict between clarity and mo...