Long 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 Hu Han 0001

> Home > Persons > Long Chen

Publications

2022
[c104]
- view
  authority control:
- export record
  dblp key:
  - conf/miccai/LiCHZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/miccai/LiCHZ22
Han Li, Long Chen, Hu Han, S. Kevin Zhou:
SATr: Slice Attention with Transformer for Universal Lesion Detection. MICCAI (3) 2022: 163-174
[i26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2203-07373
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2203-07373
Han Li, Long Chen, Hu Han, S. Kevin Zhou:
SATr: Slice Attention with Transformer for Universal Lesion Detection. CoRR abs/2203.07373 (2022)
2021
[c89]
- view
  authority control:
- export record
  dblp key:
  - conf/miccai/LiCHCZ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/miccai/LiCHCZ21
Han Li, Long Chen, Hu Han, Ying Chi, S. Kevin Zhou:
Conditional Training with Bounding Map for Universal Lesion Detection. MICCAI (5) 2021: 141-152
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2103-12277
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2103-12277
Han Li, Long Chen, Hu Han, S. Kevin Zhou:
Conditional Training with Bounding Map for Universal Lesion Detection. CoRR abs/2103.12277 (2021)

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.