Anxiao Jiang

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 Netanel Raviv

> Home > Persons > Anxiao Jiang

Publications

2022
[c66]
- view
  authority control:
- export record
  dblp key:
  - conf/itw/ZuoJRS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itw/ZuoJRS22
Xiangwu Zuo, Anxiao Andrew Jiang, Netanel Raviv, Paul H. Siegel:
Symbolic Regression for Data Storage with Side Information. ITW 2022: 208-213
2020
[c64]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/RavivJUBJ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/RavivJUBJ20
Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Anxiao Andrew Jiang:
CodNN - Robust Neural Networks From Coded Classification. ISIT 2020: 2688-2693
[c62]
- view
  authority control:
- export record
  dblp key:
  - conf/ita/HuangRJUBSJ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ita/HuangRJUBSJ20
Kunping Huang, Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Paul H. Siegel, Anxiao Andrew Jiang:
Improve Robustness of Deep Neural Networks by Coding. ITA 2020: 1-7
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2004-10700
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-10700
Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Anxiao Jiang:
CodNN - Robust Neural Networks From Coded Classification. CoRR abs/2004.10700 (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.