-
Yi Zhou: Finding Large Relaxed Cliques: Theory and Practice
Speaker: Yi Zhou (University of Electronic Science and Technology of China) Host: Management School in Northwestern Polytechnical University Time: 19:00 (Time in Beijing) June 2, 2022 (Thursday) Venue: Online, Tencent Meeting: 969 244 436 Abstract: 松弛团指的是近似完全图的图结构，是图论和组合优化领域的经典模型。松弛团模型在数据挖掘，人工智能领域有着重要的应用，而如何从大规模的图中挖掘大型松弛团则是这类应用均需解决共性问题。在本次报告中，我们将从算法工程的角度来介绍松弛团挖掘问题的分析和求解。具体来说，我们将介绍松弛团问题的背景、应用并重点介绍基于分支算法的松弛团问题理论及实践。我们还将以k-plex，最密子图等松弛团为例，介绍这类问题的当前最新的优化结果。
-
AAAI2022约束求解与启发式算法相关论文报告
Host: HCP (Workshop on Hard Computational Problems: Theory , Algorithms and Applications) Time: 13:00-19:00 (Time in Beijing) May 27, 2022 (Friday) Venue: Online, Tencent Meeting (ID: 267-356-071) Agenda: Title Authors Optimizing Binary Decision Diagrams with MaxSAT for classification Hao Hu, Mohamed Siala, Marie-José Huguet Encoding Multi-valued Decision Diagram Constraints as Binary Constraint Trees Ruiwei Wang, […]
-
Binglin Tao: Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures
Speaker: Binglin Tao (Ph.D. student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) May 20, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: As networks and their inter-connectivity grow and become complex, failures in the networks impact society and industries more than ever. To address […]
-
Private data query mechanisms for data marketplaces
Speaker: Mengxiao Zhang (Postdoc Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) May 13, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: The increasing reliance on data-driven technologies has led to the formation of an economy that is built on data trading. A data […]
-
Establishing Ties
Speaker: Jiamou Liu (Senior Lecturer, The University of Auckland) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 29, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: This talk discusses the algorithmic processes of creating ties in a social network. We view a social network as a graph where nodes represent agents and edges […]
-
USER: Unsupervised Structural Entropy-based Robust Graph Neural Network
Speaker: Yifei Wang (Ph.D. student, the University of Auckland) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 29, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: Today graph neural networks (GNN) are widely used for processing complex graph data. However, GNN models are vulnerable in real-world scenarios as the input graphs are prone […]
-
Value iteration for probabilistic verification of stochastic games
Speaker: Toru Takisaka (Postdoc Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 22, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: I give a talk about value iteration (VI) for stochastic games, which is one of the most widely used techniques in probabilistic […]
-
Approximation Algorithms for the Capacitated Vehicle Routing Problem
Speaker: Jingyang Zhao (Ph.D. student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 15, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: In the Capacitated Vehicle Routing Problem (CVRP), we are given an undirected complete graph with metric nonnegative edge weights, where there are […]
-
Automatic structures: Open questions
Speaker: Bakhadyr Khoussainov (Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 8, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: This talk will give an introduction to the theory of automatic structures, a cutting-edge research topic in logic in computer science and computation. […]
-
Listing Maximal k-Plexes in Large Real-World Graphs
Speaker: Zhengren Wang (Undergraduate student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 1, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: This talk is a report of our paper Listing Maximal k-Plexes in Large Real-World Graphs on WWW’2022. K-plexes often serve as a […]