Yunji Chen

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 Ling Liang

> Home > Persons > Yunji Chen

Publications

2021
[c47]
- view
  - electronic edition @ neurips.cc (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nips/HanXHCLDGWC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/HanXHCLDGWC21
Husheng Han, Kaidi Xu, Xing Hu, Xiaobing Chen, Ling Liang, Zidong Du, Qi Guo, Yanzhi Wang, Yunji Chen:
ScaleCert: Scalable Certified Defense against Adversarial Patches with Sparse Superficial Layers. NeurIPS 2021: 28169-28181
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-14120
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-14120
Husheng Han, Kaidi Xu, Xing Hu, Xiaobing Chen, Ling Liang, Zidong Du, Qi Guo, Yanzhi Wang, Yunji Chen:
ScaleCert: Scalable Certified Defense against Adversarial Patches with Sparse Superficial Layers. CoRR abs/2110.14120 (2021)
2020
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2009-12495
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2009-12495
Xiaobing Chen, Yuke Wang, Xinfeng Xie, Xing Hu, Abanti Basak, Ling Liang, Mingyu Yan, Lei Deng, Yufei Ding, Zidong Du, Yunji Chen, Yuan Xie:
Rubik: A Hierarchical Architecture for Efficient Graph Learning. CoRR abs/2009.12495 (2020)

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.