Jianlin Qiu

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 Jianping Chen

> Home > Persons > Jianlin Qiu

Publications

2012
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/fskd/ChenQCCP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fskd/ChenQCCP12
Yanyun Chen, Jianlin Qiu, Jianping Chen, Li Chen, Yang Pan:
A parallel rough set attribute reduction algorithm based on attribute frequency. FSKD 2012: 211-215
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icnc/PanQCGCC12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icnc/PanQCGCC12
Yang Pan, Jianlin Qiu, Li Chen, Xiang Gu, Jianping Chen, Yanyun Chen:
The research of multi-core parallel technology. ICNC 2012: 1056-1059
2010
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/icnc/JiQCCH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icnc/JiQCCH10
Dan Ji, Jianlin Qiu, Jianping Chen, Li Chen, Peng He:
An improved decision tree algorithm and its application in maize seed breeding. ICNC 2010: 117-121
2009
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/csie/QiuGCHLW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csie/QiuGCHLW09
Jianlin Qiu, Xiang Gu, Jianping Chen, Peng He, Fen Li, Bo Wang:
An Expanding Products Algorithm of Logic Functions Optimization. CSIE (2) 2009: 180-185

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.