Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuan-Sheng Cheng

dblp:53/6949 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Routing and switching · 56% Network performance modeling · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network performance modeling
delay analysis
0.112007
Logarithmic delay for N × N packet switches under the crossbar constraint · IEEE/ACM Trans. Netw. 2007
Routing and switching › switch scheduling
packet switch scheduling
0.112007
Logarithmic delay for N × N packet switches under the crossbar constraint · IEEE/ACM Trans. Netw. 2007
Routing and switching
input-queued switch
0.012007
Logarithmic delay for N × N packet switches under the crossbar constraint · IEEE/ACM Trans. Netw. 2007

Methods — techniques the papers use, named apart from their topics

scheduling algorithm · 0.1queueing analysis · 0.1
YearPublicationVenuePosition
2021 Interleaver Design and Pairwise Codeword Distance Distribution Enhancement for Turbo Autoencoder
abstract
This paper enhances the performance and training of the Turbo Autoencoder (TurboAE), an end-to-end jointly trained neural channel encoder and decoder. A novel interleaver for TurboAE with convolutional neural network (CNN) is proposed, which is shown to enhance the end-to-end performance of both TurboAE continuous and binary. Thanks to the proposed interleaver, TurboAE binary performs better than a benchmark Turbo code of length 100. In addition, a novel additional term to the loss function is proposed to improve the pairwise distance distribution of the codewords, which is shown to help the training convergence of TurboAE with CNN and recurrent neural network (RNN).
Hikmet Yildiz, Homayoon Hatami, Hamid Saber, Yuan-Sheng Cheng, Jung Hyun Bae
GLOBECOM4
2007 Logarithmic delay for N × N packet switches under the crossbar constraint
Michael J. Neely, Eytan H. Modiano, Yuan-Sheng Cheng
IEEE/ACM Trans. Netw.3
2006 Iterative Message Passing Algorithm for Bipartite Maximum Weighted Matching
abstract
We derive iterative message passing update rules for solving the bipartite maximum weighted matching problem. It is shown that if the optimal matching solution is unique, the algorithm converges to this optimal solution at a rate comparable to the algorithm of Bayati et. al. It is shown that the two algorithms are both standard messages passing, but on dual graphs of each other. Also, the algorithm presented here requires less storage. We also provide a method to use the proposed algorithm to solve the integer maximal weighted matching problem - i.e., where the optimal solution is generally not unique
Yuan-Sheng Cheng, Michael J. Neely, Keith M. Chugg
ISIT1