Qingliang Hu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Xiangfeng Luo

> Home > Persons > Qingliang Hu

Publications

2010
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/IEEEicci/LuoCH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/IEEEicci/LuoCH10
Xiangfeng Luo, Chuanliang Cai, Qingliang Hu:
Text knowledge representation model based on human concept learning. IEEE ICCI 2010: 383-390
2009
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/LuoXLHYT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/LuoXLHYT09
Xiangfeng Luo, Zheng Xu, Qing Li, Qingliang Hu, Jie Yu, Xinhuai Tang:
Generation of similarity knowledge flow for intelligent browsing based on semantic link networks. Concurr. Comput. Pract. Exp. 21(16): 2018-2032 (2009)
2008
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/LuoHXY08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/LuoHXY08
Xiangfeng Luo, Qingliang Hu, Weimin Xu, Zhian Yu:
Discovery of textual knowledge flow based on the management of knowledge maps. Concurr. Comput. Pract. Exp. 20(15): 1791-1806 (2008)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/gpc/LuoHLYT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gpc/LuoHLYT08
Xiangfeng Luo, Qingliang Hu, Fangfang Liu, Jie Yu, Xinhuai Tang:
Textual Knowledge Flow Based Intelligent Browsing of Topics. GPC Workshops 2008: 57-62

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.