正規賭平臺網址

學術動態

當前位置: 首頁 > 科學研究 > 學術動態 > 正文

【學術預告】On Computing a Center Persistence Diagram

發布日期:2019-07-17    作者:     來源:     點擊:

報告題目:On Computing a Center Persistence Diagram (持續性圖中心的求解計算)

報告人:朱濱海,美國蒙大拿州立大學計算機科學系教授

時間:2019年7月24日10:00am – 12:00am.

地點:全國十大賭博官網辦公樓202會議室

摘要:Persistence diagram is a new tool from computational topology to capture the topological and geometric changes for large point clouds (or more complex objects). This talk first introduces the basics on persistence diagrams (e.g., the bottleneck distance between two diagrams). Then, we consider the center persistence diagram problem, i.e., one whose maximum bottleneck distance to m given diagrams is minimized . We show that, when m=2 diagrams are given, the problem is polynomially solvable. When m=3, we prove its NP-hardness (in fact, NP-hard to approximate within a factor of 2). Finally, we give a tight factor-2 approximation for the problem. No prior knowledge on topology is needed for this talk.

地址:中國濟南高新技術產業開發區舜華路1500號        郵編:250101

電話:(86)-531-88391516        傳真:(86)-531-88391686

掃一掃
關注公眾號
江西十一选五5开奖结果