Yan Zhao 0008

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 Xu Chen 0023

> Home > Persons > Yan Zhao 0008

Publications

2024
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/tkde/LiuCZSZZ24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkde/LiuCZSZZ24
Shuncheng Liu, Xu Chen, Yan Zhao, Han Su, Xiaofang Zhou, Kai Zheng:
Comfort-Aware Lane Change Planning With Exit Strategy for Autonomous Vehicle. IEEE Trans. Knowl. Data Eng. 36(7): 2927-2941 (2024)
2023
[c42]
- view
  authority control:
- export record
  dblp key:
  - conf/icdm/LiangCZX0023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/LiangCZX0023
Zibo Liang, Xu Chen, Yan Zhao, Jiandong Xie, Kai Zeng, Kai Zheng:
Efficient Cardinality and Cost Estimation with Bidirectional Compressor-based Ensemble Learning. ICDM 2023: 388-397
2022
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/cikm/0001000Z022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cikm/0001000Z022
Shuncheng Liu, Xu Chen, Yan Zhao, Jin Chen, Rui Zhou, Kai Zheng:
Efficient Learning with Pseudo Labels for Query Cost Estimation. CIKM 2022: 1309-1318
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/kdd/0008Y000CZ022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kdd/0008Y000CZ022
Jin Chen, Guanyu Ye, Yan Zhao, Shuncheng Liu, Liwei Deng, Xu Chen, Rui Zhou, Kai Zheng:
Efficient Join Order Selection Learning with Graph-based Representation. KDD 2022: 97-107

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.