Yanran Li

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 Xunlai Chen

> Home > Persons > Yanran Li

Publications

2023
[c35]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/NingLLCCC0C23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/NingLLCCC0C23
Shuliang Ning, Mengcheng Lan, Yanran Li, Chaofeng Chen, Qian Chen, Xunlai Chen, Xiaoguang Han, Shuguang Cui:
MIMO Is All You Need：A Strong Multi-in-Multi-Out Baseline for Video Prediction. AAAI 2023: 1975-1983
2022
[i16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2212-04655
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2212-04655
Shuliang Ning, Mengcheng Lan, Yanran Li, Chaofeng Chen, Qian Chen, Xunlai Chen, Xiaoguang Han, Shuguang Cui:
MIMO Is All You Need : A Strong Multi-In-Multi-Out Baseline for Video Prediction. CoRR abs/2212.04655 (2022)
2021
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2107-10068
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2107-10068
Mengcheng Lan, Shuliang Ning, Yanran Li, Qian Chen, Xunlai Chen, Xiaoguang Han, Shuguang Cui:
From Single to Multiple: Leveraging Multi-level Prediction Spaces for Video Forecasting. CoRR abs/2107.10068 (2021)

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.