CS Peer Talk | Exact and Approximate Solutions…

398次阅读
没有评论

CS Peer Talk | Exact and Approximate Solutions...

第三十七期

报告人:Haoqiang Huang, HKUST

时间:12月27日(星期三)4:00pm

地点:静园五院204

报告信息

Title

Exact and Approximate Solutions for Fréchet Problems

Abstract

In this talk, we will present several new algorithmic results regarding polygonal curves under Fréchet distance, including curve simplification, clustering, nearest neighbor, and some others.

In the first part, we will focus on the first bicriteria approximation scheme for curve simplification under Fréchet distance. We will present a novel discretization of the searching space and a useful geometric construct that lead us to the approximation scheme. With further development, the discretization strategy provides us with an encoding scheme for an arbitrary curve with respect to a set of fixed curves. This new encoding scheme allows us to design the first approximate nearest neighbor data structure for polygonal curves in d-dimensional space under the Fréchet distance with bounded space complexity for d larger than 1.

In the second part, we will switch our attention to exact solutions. We will characterize Fréchet distance by a polynomial system and study multiple Fréchet problems via algebraic methods. This new algebraic perspective allows us to get exact solutions for a wide range of problems including curve simplification and nearest neighbor, which are unknown until this work.

Biography

 CS Peer Talk | Exact and Approximate Solutions...

Haoqiang Huang is currently a fourth-year Ph.D. student at HKUST under the supervision of Prof. Siu-Wing Cheng. He received his B. Eng in the School of Computer Science and Technology at USTC. His research interests lie in computational geometry and especially the algorithmic problems motivated by data mining on trajectories and time series.

about CS Peer Talk

作为活动的发起人,我们来自北京大学图灵班科研活动委员会,主要由图灵班各年级同学组成。我们希望搭建一个CS同学交流的平台,促进同学间的交流合作,帮助同学练习展示,同时增进友谊。

目前在计划中的系列包括但不限于:

  • 教程系列学生讲者为主,介绍自己的研究领域

  • 研究系列学生讲者为主,介绍自己的研究成果

  • 客座系列邀请老师做主题报告

除非报告人特别要求,报告默认是非公开的,希望营造一个自由放松但又互相激励的交流氛围。

CS Peer Talk | Exact and Approximate Solutions...

主讲嘉宾招募

如果你愿意和大家分享你的学术成果、经历经验,总结回顾、触发新思,欢迎报名自荐


主讲人报名:发邮件至 cs_research_tc@163.com,写明想讲的题目、内容及时间。

CS Peer Talk | Exact and Approximate Solutions...

CS Peer Talk | Exact and Approximate Solutions...

北京大学图灵班科研活动委员会

CS Peer Talk | Exact and Approximate Solutions...

—   版权声明  —

本微信公众号所有内容,由北京大学前沿计算研究中心微信自身创作、收集的文字、图片和音视频资料,版权属北京大学前沿计算研究中心微信所有;从公开渠道收集、整理及授权转载的文字、图片和音视频资料,版权属原作者。本公众号内容原作者如不愿意在本号刊登内容,请及时通知本号,予以删除。

CS Peer Talk | Exact and Approximate Solutions...

 

Read More 

正文完
可以使用微信扫码关注公众号(ID:xzluomor)
post-qrcode
 
评论(没有评论)
Generated by Feedzy