-
New Algorithms for Constrained Clustering Problems
Speaker: Qilong Feng(Central South University) Time: 11:00 (Time in Beijing) 15:00 (Time in Auckland) June 17, 2021 (Thursday) Venue: Baixue Tang, UESTC Library Abstract: Designing approximation algorithms for the clustering problem remains an active area of research. However, these algorithms can significantly deteriorate their performance in real-world applications. The major reason is that real-world applications […]
-
Some efficient algorithms for the k-vertex cover problem
Speaker: Yijia Chen(Shanghai Jiao Tong University) Time: 11:00-12:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) May 20, 2021 (Thursday) Venue: B1-501, Main Building Abstract: Let be a fixed constant. The -vertex cover problem asks, for an input graph , whether contains vertices which intersect every edge in . The problem has been studied extensively both […]
-
Mathematical Principles of Information Sciences, II: Mathematical Theory of Intuitive Reasoning
Speaker: Angsheng Li(Beihang University) Time: 14:00-15:00 (Time in Beijing) 18:00-19:00 (Time in Auckland) April 9, 2021 (Friday) Venue: B1-501, Main Building Abstract: Started at Hilbert’s 1900 program of axiomatizing mathematics, in 1930s, mathematicians including Gödel proposed the definition of “proof” and established the subject of mathematical logic, and more importantly, Turing 1936 proposed a mathematical […]
-
Mathematical Principles of Information Sciences, I: The Laws of Information
Speaker: Angsheng Li(Beihang University) Time: 11:00-12:00(Time in Beijing) 15:00-16:00(Time in Auckland) April 8, 2021 (Thursday) Venue: Coffee Beanery (宾诺咖啡) Abstract: Shannon 1945 and 1948 started the mathematical studies of cryptography and of communication, respectively. In 1945,Shannon proposed an information theoretical protocol for data security, leading to the mathematical theory of data security. In 1948, Shannon […]
-
Computation, Randomness and Dimensionality
Speaker: George Barmpalias (Chinese Academy of Sciences) Time: 11:00AM(Time in Beijing) 4:00PM(Time in Auckland) March 11, 2021 (Thursday) Address: Online meeting VooVmeeting: ID: 222 489 953 Password: 202103 Link: https://meeting.tencent.com/s/OgG2rzHAiky1 Abstract: Randomness is a precious resource in computation and modeling, where access to a random source with specific properties is needed. Transforming one type of […]
-
A simple deterministic pseudopolynomial time algorithms for subset sum
Speaker: Chao Xu(The Voleon Group) Time: 11:00AM(Time in Beijing) 4:00PM(Time in Auckland) January 6, 2021 (Wednesday) VooVmeeting ID：360572001 Password: 1936 Link: https://meeting.tencent.com/s/Hu6RyhQq2MPc Abstract: Given a set of n positive integers and a target integer t, the subset sum problem asks if there exists a subset with elements sum to t. Bellman (1956) found a dynamic […]
-
Multi-Unit Auction in Social Networks with Budgets
Speaker: Mingyu Xiao (University of Electronic Science and Technology of China) Time: 11:00AM(Time in Beijing) 4:00PM(Time in Auckland) December 10, 2020 (Thursday) VooVmeeting ID：109659528 Password: 408321 Link: https://meeting.tencent.com/s/W9L2p3l48QGM Abstract: Private data query combines mechanism design with privacy protection to produce aggregated statistics from privately-owned data records. The problem arises in a data marketplace where data […]
-
Selling Data at an Auction under Privacy Constraints
Speaker: Jiamou Liu (The University of Auckland) Time: 11:00AM(Time in Beijing) 4:00PM(Time in Auckland) November 5, 2020 (Thursday) VooVmeeting ID： 109659528 Password: 408321 Link: https://meeting.tencent.com/s/W9L2p3l48QGM Abstract: Private data query combines mechanism design with privacy protection to produce aggregated statistics from privately-owned data records. The problem arises in a data marketplace where data owners have personalised […]