刘显敏科研成果_刘显敏专利信息_哈尔滨工业大学计算学部刘显敏科研信息|刘显敏校企合作信息|刘显敏联系方式
全国客户服务热线:4006-054-001 疑难解答:159-9855-7370(7X24受理投诉、建议、合作、售前咨询),173-0411-9111(售前),155-4267-2990(售前),座机/传真:0411-83767788(售后),微信咨询:543646
企业服务导航

刘显敏科研成果

发布日期:2024-05-10 专利申请、商标注册、软件著作权、资质办理快速响应 微信:543646


刘显敏
姓名 刘显敏 性别 刘显敏
学校 哈尔滨工业大学 部门 计算学部
学位 刘显敏 学历 刘显敏
职称 副教授 联系方式 86403492
邮箱 liuxianmin@hit.edu.cn    
软件产品登记测试全国受理 软件著作权666元代写全部资料全国受理 实用新型专利1875代写全部资料全国受理
刘显敏

基本信息 Research Interests Teaching Publications 新建主栏目 Xianmin Liu 名称 Associated Professor of Department of Computer Science and Technology, Harbin Institute of Technology. My research interests include massive data computing, data quality and so on. Working Experiences 名称 2014-2017, assistant professor, HIT 2018-now, associated professor, HIT Education 名称 2008 - 2013, Ph.D., Computer Science, Harbin Institute of Technology, Advisor: Professor Jianzhong Li 2006 - 2008, Undergraduate, Computer Science, Harbin Institute of Technology, Advisor: Professor Jianzhong Li 2002 - 2006, B.S., Computer Science, Harbin Institute of Technology Research Interests 名称 Massive Data Computing Data Quality Courses 名称 Database System. 2014, 2015 Data Structures and Algorithms. 2017 Data Mining. 2014~2018 Foundation of Big Data Computing. 2018 Publications 名称 Faming Li, Zhaonian Zou, Xianmin Liu, Jianzhong Li, Xiaochun Yang, Bin Wang. Detecting maximum k-durable structures on temporal graphs. Knowl. Based Syst. 271: 110561 (2023) Shuai Han, Xianmin Liu, Jianzhong Li. Chunk-oriented dimension ordering for efficient range query processing on sparse multidimensional data. World Wide Web (WWW) 26(4): 1395-1433 (2023) Xianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li. Tree size reduction with keeping distinguishability. Theor. Comput. Sci. 749: 26-35 (2018) Xianmin Liu, Yingshu Li, Jianzhong Li:Repair Position Selection for Inconsistent Data. COCOA (1) 2017: 426-438 Xixian Han, Xianmin Liu, Jianzhong Li, Hong Gao:TKAP: Efficiently processing top-k query on massive data by adaptive pruning. Knowl. Inf. Syst. 47(2): 301-328 (2016) Xianmin Liu, Jianzhong Li, Hong Gao:On the hardness of labeled correlation clustering problem: A parameterized complexity view. Theor. Comput. Sci. 609: 583-593 (2016) Dongjing Miao, Xianmin Liu, Jianzhong Li:On the complexity of sampling query feedback restricted database repair of functional dependency violations. Theor. Comput. Sci. 609: 594-605 (2016) Xianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li: On the Complexity of Extracting Subtree with Keeping Distinguishability. COCOA 2016: 230-240 Dongjing Miao, Yingshu Li, Xianmin Liu, Jianzhong Li: On the Complexity of Bounded Deletion Propagation. COCOA 2016: 453-462 Dongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li: On the Complexity of Insertion Propagation with Functional Dependency Constraints.COCOON 2016: 623-632 Xianmin Liu, Jianzhong Li: Algorithms and complexity results for labeled correlation clustering problem. J. Comb. Optim. 29(2): 488-501 (2015) Xianmin Liu, Jianzhong Li: On the hardness of learning queries from tree structured data. J. Comb. Optim. 29(3): 670-684 (2015) Dongjing Miao, Xianmin Liu, Jianzhong Li: Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm. COCOON 2014: 37-48 Xianmin Liu, Jianzhong Li, Hong Gao: On the Parameterized Complexity of Labelled Correlation Clustering Problem. COCOON 2014: 276-287