Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShenghao Yang
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Shenghao Yang 0001
![[0000-0003-1987-5643]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-1987-5643")
— The Chinese University of Hong Kong, Shenzhen, China - Shenghao Yang 0002 — University of Waterloo, Waterloo, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Shenghao Yang, Yiqun Liu, Xiaohui Xie, Min Zhang, Shaoping Ma:
Enhance Performance of Ad-hoc Search via Prompt Learning. CCIR 2022: 28-39- [c14]Jia Chen, Yiqun Liu, Yan Fang, Jiaxin Mao, Hui Fang, Shenghao Yang, Xiaohui Xie, Min Zhang, Shaoping Ma:
Axiomatically Regularized Pre-training for Ad hoc Search. SIGIR 2022: 1524-1534 - 2020
- [j4]Shenghao Yang, Xiaolan Zhu, Lei Zhang, Lu Wang, Xiaoying Wang:
Classification and Prediction of Tibetan Medical Syndrome Based on the Improved BP Neural Network. IEEE Access 8: 31114-31125 (2020) - [j3]Kai Li, Shenghao Yang, Runting Dong, Xiaoying Wang, Jianqiang Huang:
Survey of single image super-resolution reconstruction. IET Image Process. 14(11): 2273-2290 (2020) - [c13]Shenghao Yang, Jie Wang:
Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks. ISIT 2020: 1629-1634 - [c12]Yanyan Dong, Shenghao Yang:
On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels. ISITA 2020: 146-150 - [i7]Shenghao Yang, Jie Wang:
Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks. CoRR abs/2001.04055 (2020) - [i6]Yanyan Dong, Shenghao Yang:
On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels. CoRR abs/2006.07603 (2020)
2010 – 2019
- 2019
- [c11]Xinfei Meng, Xiaolan Zhu, Shenghao Yang, Lu Wang, Jun Qi, Pei Yang:
Research on Wine Analysis Based on Data Preprocessing. ICNC-FSKD 2019: 583-594 - 2018
- [c10]Jie Wang, Shenghao Yang, Congduan Li:
On the Tightness of a Cut-Set Bound on Network Function Computation. ISIT 2018: 1824-1828 - 2017
- [i5]Zhiheng Zhou, Congduan Li, Shenghao Yang, Xuan Guang:
Practical Inner Codes for Batched Sparse Codes in Wireless Multihop Networks. CoRR abs/1709.00588 (2017) - 2016
- [j2]Bin Tang, Shenghao Yang, Baoliu Ye, Song Guo, Sanglu Lu:
Near-Optimal One-Sided Scheduling for Coded Segmented Network Coding. IEEE Trans. Computers 65(3): 929-939 (2016) - [c9]Bin Tang, Shenghao Yang:
An improved design of overlapped chunked codes. ICC 2016: 1-6 - [c8]Xuan Guang, Shenghao Yang, Congduan Li:
An improved upper bound on network function computation using cut-set partition. ITW 2016: 11-15 - 2015
- [j1]Bin Tang, Shenghao Yang, Baoliu Ye, Yitong Yin, Sanglu Lu:
Expander chunked codes. EURASIP J. Adv. Signal Process. 2015: 106 (2015) - [c7]Zhixue Zhang, Shenghao Yang:
An intrinsic relation between secure network coding and network error correction. ChinaCom 2015: 148-152 - [c6]Cupjin Huang, Zihan Tan, Shenghao Yang:
Upper bound on function computation in directed acyclic networks. ITW 2015: 1-5 - [i4]Cupjin Huang, Zihan Tan, Shenghao Yang:
Upper Bound on Function Computation in Directed Acyclic Networks. CoRR abs/1501.01084 (2015) - 2014
- [c5]Shenghao Yang, Bin Tang:
From LDPC to chunked network codes. ITW 2014: 406-410 - 2013
- [c4]Tsz-Ching Ng, Shenghao Yang:
Finite-length analysis of BATS codes. NetCod 2013: 1-6 - [i3]Bin Tang, Shenghao Yang, Baoliu Ye, Yitong Yin, Sanglu Lu:
Expander Chunked Codes. CoRR abs/1307.5664 (2013) - [i2]Tsz-Ching Ng, Shenghao Yang:
Finite-Length Analysis of BATS Codes. CoRR abs/1312.4811 (2013) - 2012
- [c3]Bin Tang, Shenghao Yang, Yitong Yin, Baoliu Ye, Sanglu Lu:
Expander graph based overlapped chunked codes. ISIT 2012: 2451-2455 - [c2]Shenghao Yang:
Superposition coding for linear operator channels over finite fields. ITW 2012: 502-506 - 2011
- [c1]Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi:
Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources. ISIT 2011: 598-602 - [i1]Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi:
Beyond the Cut Set Bound: Uncertainty Computations in Network Coding with Correlated Sources. CoRR abs/1103.3596 (2011)
2000 – 2009
- 2008
- [b1]Shenghao Yang:
Coherent network error correction. Chinese University of Hong Kong, Hong Kong, 2008
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-05-17 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
