Author image not provided
 Yunchao Wei

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.33
Citation Count7
Publication count3
Publication years2014-2016
Available for download1
Average downloads per article162.00
Downloads (cumulative)162
Downloads (12 Months)53
Downloads (6 Weeks)4
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


3 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 3 of 3
Sort by:

1 published by ACM
March 2016 ACM Transactions on Intelligent Systems and Technology (TIST) - Special Issue on Crowd in Intelligent Systems, Research Note/Short Paper and Regular Papers: Volume 7 Issue 4, July 2016
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 4,   Downloads (12 Months): 53,   Downloads (Overall): 162

Full text available: PDFPDF
In this article, we investigate the cross-media retrieval between images and text, that is, using image to search text (I2T) and using text to search images (T2I). Existing cross-media retrieval methods usually learn one couple of projections, by which the original features of images and text can be projected into ...
Keywords: Cross-media retrieval, canonical correlation analysis, subspace learning

2
February 2016 AAAI'16: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

Rectified linear activation units are important components for state-of-the-art deep convolutional networks. In this paper, we propose a novel S-shaped rectified linear activation unit (SReLU) to learn both convex and non-convex functions, imitating the multiple function forms given by the two fundamental laws, namely the Webner-Fechner law and the Stevens ...

3
July 2014 AAAI'14: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

This paper proposes the Proximal Iteratively REweighted (PIRE) algorithm for solving a general problem, which involves a large body of nonconvex sparse and structured sparse related problems. Comparing with previous iterative solvers for nonconvex sparse problem, PIRE is much more general and efficient. The computational cost of PIRE in each ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us