Kai Lei

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 Yingxia Shao

> Home > Persons > Kai Lei

Publications

2020
[c89]
- view
  authority control:
- export record
  dblp key:
  - conf/apweb/ZhangSLZ020
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apweb/ZhangSLZ020
Minxu Zhang, Yingxia Shao, Kai Lei, Yuesheng Zhu, Bin Cui:
Densely-Connected Transformer with Co-attentive Information for Matching Text Sequences. APWeb/WAIM (2) 2020: 230-244
2019
[c82]
- view
  authority control:
- export record
  dblp key:
  - conf/dasfaa/SunSJ0LXW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dasfaa/SunSJ0LXW19
Haobo Sun, Yingxia Shao, Jiawei Jiang, Bin Cui, Kai Lei, Yu Xu, Jiang Wang:
Sparse Gradient Compression for Distributed SGD. DASFAA (2) 2019: 139-155
2018
[c67]
- view
  authority control:
- export record
  dblp key:
  - conf/icde/ShaoLCH0LTX18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icde/ShaoLCH0LTX18
Yingxia Shao, Kai Lei, Lei Chen, Zi Huang, Bin Cui, Zhongyi Liu, Yunhai Tong, Jin Xu:
Fast Parallel Path Concatenation for Graph Extraction. ICDE 2018: 1753-1754
2017
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tkde/ShaoLCHCLTX17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkde/ShaoLCHCLTX17
Yingxia Shao, Kai Lei, Lei Chen, Zi Huang, Bin Cui, Zhongyi Liu, Yunhai Tong, Jin Xu:
Fast Parallel Path Concatenation for Graph Extraction. IEEE Trans. Knowl. Data Eng. 29(10): 2210-2222 (2017)

a service of

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.