-
05-31
2007
Probabilistic Graphical Models --- theory, algorithm, and application:Overview o
Speaker: Eric Xing Carnegie Mellon University Time: 2007-05-31 16:00-2007-05-31 17:00 Venue: FIT Building 4-603, Tsinghua University Abstract: The past decade has seen a growing trend of applying ...
-
05-31
2007
Structure from Proximity
Speaker: Leonidas J. Guibas Stanford University Time: 2007-05-31 14:30-2007-05-31 15:30 Venue: FIT Building 4-603, Tsinghua University Abstract: Data sets consisting of points sampled from an unde...
-
05-29
2007
Quantum communication complexity of block-composed functions
Speaker: Yaoyun Shi EECS, University of Michigan, Ann Arbor Time: 2007-05-29 14:00-2007-05-29 15:00 Venue: FIT Building 4-603, Tsinghua University Abstract: A central open problem in communication ...
-
05-15
2007
Describing vs. proving: connecting bounded arithmetic and descriptive complexity
Speaker: Antonina Kolokolova Simon Fraser University Time: 2007-05-15 15:00-2007-05-15 16:00 Venue: FIT Building 4-603, Tsinghua University Abstract: In this talk, we discuss and relate the framewo...
-
05-15
2007
Chernoff-type Direct Product Theorems
Speaker: Valentine Kabanets Simon Fraser University Time: 2007-05-15 14:00-2007-05-15 15:00 Venue: FIT Building 4-603, Tsinghua University Abstract: Consider a challenge-response protocol, where a ...
-
04-20
2007
co-B\"uchi Rankings and omega-Automata Transformations
Speaker: Qiqi Yan Shanghai Jiao Tong University Time: 2007-04-20 15:30-2007-04-20 16:30 Venue: FIT Building,Tsinghua University Abstract: Ranking-based constructions have been proposed for the comp...