-
尹一通：计算采样的理论基础（Theoretical Foundations of Computational Sampling）
Yitong Yin (Nanjing University) Time: 16:20-17:20 (Time in Beijing) November 30, 2023 (Thursday) Venue: Binnuo Coffee Abstract: 蒙特卡罗法（Monte Carlo methods）是与计算机同一时期诞生的二十世纪最重要的科技产物之一。这一方法利用随机采样来高效计算原本传统确定性方法难以计算的量。它的发现拓展了人类高效计算的边界，深刻地影响了人们对计算本质的理解。在这一计算优越性的帮助下带来的科学新发现也塑造了人们今天对客观世界的认识。 本报告将系统介绍报告人近年来在计算采样理论、以及现代蒙特卡罗算法的设计与分析等方面取得的系统性的重要进展，包括：刻画高位概率分布可高效采样条件的“计算相变”定理；马尔可夫链蒙特卡罗（MCMC）采样的并行与分布式算法和局部与动态算法等。 Speaker Bio: 尹一通，南京大学教授，新基石研究员；本科毕业于南京大学，博士毕业于耶鲁大学；博士毕业后在南京大学工作至今，目前担任南京大学理论计算机科学团队负责人。尹一通的研究领域为理论计算机科学，主要研究兴趣包括：随机算法、计算采样，数据结构、并行与分布式计算理论等。在JACM、SICOMP、STOC、FOCS、SODA等理论计算机科学的重要期刊与会议发表论文五十余篇。主持国家重点研发计划项目“数据科学的若干基础理论”，获国家自然科学基金-优秀青年科学基金支持，曾获CCF/IEEE CS青年科学家、CCF优博导师、中创软件人才奖、教育部新世纪人才、南京大学青年五四奖章等荣誉。
-
Fang Kong: Bandit Learning with Side Information
() Time: 16:20-17:20 (Time in Beijing) November 29, 2023 (Wednesday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Fang Kong is currently a Ph.D. candidate in the John Hopcroft Center for Computer Science, Shanghai Jiao Tong University. She is also a member in Wu Honor Ph.D. Class in Artificial Intelligence. Fang received her B.S. degree […]
-
曹皖林: 形式化技术及其应用
Speaker: 曹皖林（美国德州农工大学） Time: 10:20-11:20 (Time in Beijing) November 17, 2023 (Friday) Venue: 518, Research Building 4 Abstract: 软硬件系统开发包括不断地进行优化和验证，形式化方法在这个过程中被广泛应用。本讲座结合芯片开发过程中的最常见逻辑表达方式和分析手段，介绍形式化技术。具体包括以下内容：– 设计的网表表达– BDD 及其应用– 逻辑的计算与近似– 实例：低功耗优化– 讨论：布尔代数、NP问题、抽象及计算 Speaker Bio: 曹皖林，美国Texas A&M 大学博士，合见工业软件集团 fellow。研究兴趣包括：形式化方法，EDA与FPGA工具开发。
-
Ton Kloks: Excluding a long double path minor
Speaker: Ton Kloks (National Tsing Hua University ) Time: 10:20-11:20 (Time in Beijing) November 10, 2023 (Friday) Venue: 518, Research Building 4 Abstract: This is a paper from 1994. (In my opinion this paper is a work of art.) The paper proves Robertson’s conjecture on well-quasi-orders by topological minors for classes of graphs that are closed […]
-
Ton Kloks: Excluding a long double path minor
Speaker: Ton Kloks (National Tsing Hua University ) Time: 10:20-11:20 (Time in Beijing) November 3, 2023 (Friday) Venue: 518, Research Building 4 Abstract: This is a paper from 1994. (In my opinion this paper is a work of art.) The paper proves Robertson’s conjecture on well-quasi-orders by topological minors for classes of graphs that are closed […]
-
Huairui Chu: FPT Approximation Using Treewidth
Speaker: Huairui Chu (Nanjing University ) Time: 16:00-17:00 (Time in Beijing) October 25, 2023 (Wednesday) Venue: 518, Research Building 4 Abstract: Treewidth is a useful tool in designing graph algorithms. Although many NP-hard graph problems can be solved in linear time when the input graphs have small treewidth, there are problems which remain hard on […]
-
Yan Gu:Recent Advances in Parallel Algorithm Design
Speaker: Yan Gu（University of California, Riverside) Time: 16:20-17:20 (Time in Beijing) September 8, 2023 (Friday) Venue: 518, Research Building 4 Abstract: This talk will cover some new advances in recent parallel algorithm research. We will introduce a few new parallel algorithms on classic graph problems such as single-source shortest paths (the rho-stepping and the delta*-stepping […]
-
Yan Gu:Introduction to Parallel Algorithms
Speaker: Yan Gu（University of California, Riverside) Time: 10:20-11:20 (Time in Beijing) September 8, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Parallel processors are ubiquitous nowadays and it is almost impossible to find a single-core processor, probably other than a toaster. However, very few courses and online materials cover the basic knowledge for designing parallel […]
-
Yiding Feng: Mobility Data in Operations: The Facility Location Problem
Speaker: Yiding Feng（University of Chicago) Time: 11:00-12:00 (Time in Beijing) August 4, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Yiding Feng is a postdoctoral principal researcher at the University of Chicago Booth School of Business. Previously, he worked as a postdoctoral researcher at Microsoft Research New England from 2021 to 2023. He […]
-
Louxin Zhang: A Scalable Algorithm for Inferring Phylogenetic Networks from Trees
Speaker: Louxin Zhang （新加坡国立大学） Time: July 3, 2023 (Monday) 10:30-11:30am Venue: 电子科技大学清水河校区主楼B1-501 Abstract: Phylogenetic networks are rooted, acyclic directed graph in which leaves are labelled with genes, genomes or species. They are used to model evolution with reticulate events. The reconstruction of phylogenetic networks is an important but challenging problem in phylogenetics and genome evolution, […]