1.2k citations
- Chinese Academy of SciencesCN254 papers
- University of Chinese Academy of SciencesCN111 papers
- University of Science and Technology of ChinaCN17 papers
- Peking UniversityCN13 papers
- Tencent (China)CN13 papers
- Tsinghua UniversityCN10 papers
- Beihang UniversityCN9 papers
- Microsoft Research Asia (China)CN8 papers
- National University of SingaporeSG8 papers
- Peng Cheng LaboratoryCN8 papers
- Institute of Information EngineeringCN6 papers
- Lenovo (China)CN6 papers
49 papers · 1 filter
Asymmetric GAN for Unpaired Image-to-image Translation
Yu Li, Sheng Tang, Rui Zhang +3
Unpaired image-to-image translation problem aims to model the mapping from one domain to another with unpaired training data. Current works like the well-acknowledged Cycle GAN pro…
A Logical Model for Supporting Social Commonsense Knowledge Acquisition
Zhenzhen Gu, Cungen Cao, Ya Wang +1
To make machine exhibit human-like abilities in the domains like robotics and conversation, social commonsense knowledge (SCK), i.e., common sense about social contexts and social…
Fast Image Caption Generation with Position Alignment
Zheng-cong Fei
Recent neural network models for image captioning usually employ an encoder-decoder architecture, where the decoder adopts a recursive sequence decoding way. However, such autoregr…
Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems via Joint Transmit and Reflective Beamforming
Hailiang Xie, Jie Xu, Ya-Feng Liu
This paper investigates an intelligent reflecting surface (IRS)-aided multi-cell multiple-input single-output (MISO) system consisting of several multi-antenna base stations (BSs)…
Fast Stochastic Ordinal Embedding with Variance Reduction and Adaptive Step Size
Ke Ma, Jinshan Zeng, Qianqian Xu +3
Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are based on semi…
Hybrid Decision Trees: Longer Quantum Time is Strictly More Powerful
Xiaoming Sun, Yufan Zheng
In this paper, we introduce the hybrid query complexity, denoted as , which is the minimal query number needed to compute , when a classical decision tree is al…