Minimum Content Representation: Complexity, Algorithms and Applications
讲座名称：
Minimum Content Representation: Complexity, Algorithms and Applications
讲座时间：
2013-12-19
讲座人：
朱滨海
形式：
校区：
兴庆校区
实践学分：
讲座内容：
美国蒙大拿州立大学计算机系朱滨海教授、香港城市大学CK Poon教授讲座
报告人：美国蒙大拿州立大学 朱滨海教授
报告题目：Minimum Content Representation: Complexity, Algorithms and Applications
报告摘要：In social networks and data mining, a prominent problem is to select the right social individuals (resp. data) which conform to the corresponding groups in the network (resp. data constraints). Recently we initiate the algorithmic research to study these problems more formally. Almost all these problems are NP-hard; for instance, even when each group contains only two individuals, selecting the minimum number of individuals to represent the original relations among all the groups in the given social network is already NP-complete. In this talk, I will introduce the current status of these research and present some open problems.
时间：2013年12月19日（周四）上午9:00
地点：科学馆207
相关视频