6 citations · 23 across the 17 of their papers we have counts for
18 papers
Ensure Timeliness and Accuracy: A Novel Sliding Window Data Stream Paradigm for Live Streaming Recommendation
Fengqi Liang, Baigong Zheng, Liqin Zhao +3
Live streaming recommender system is specifically designed to recommend real-time live streaming of interest to users. Due to the dynamic changes of live content, improving the tim…
Fluent and Low-latency Simultaneous Speech-to-Speech Translation with Self-adaptive Training
Renjie Zheng, Mingbo Ma, Baigong Zheng +4
Simultaneous speech-to-speech translation is widely useful but extremely challenging, since it needs to generate target-language speech concurrently with the source-language speech…
Opportunistic Decoding with Timely Correction for Simultaneous Translation
Renjie Zheng, Mingbo Ma, Baigong Zheng +2
Simultaneous translation has many important application scenarios and attracts much attention from both academia and industry recently. Most existing frameworks, however, have diff…
Simultaneous Translation Policies: From Fixed to Adaptive
Baigong Zheng, Kaibo Liu, Renjie Zheng +3
Adaptive policies are better than fixed policies for simultaneous translation, since they can flexibly balance the tradeoff between translation quality and latency based on the cur…
Incremental Text-to-Speech Synthesis with Prefix-to-Prefix Framework
Mingbo Ma, Baigong Zheng, Kaibo Liu +5
Text-to-speech synthesis (TTS) has witnessed rapid progress in recent years, where neural methods became capable of producing audios with high naturalness. However, these efforts s…
Speculative Beam Search for Simultaneous Translation
Renjie Zheng, Mingbo Ma, Baigong Zheng +1
Beam search is universally used in full-sentence translation but its application to simultaneous translation remains non-trivial, where output words are committed on the fly. In pa…
Simpler and Faster Learning of Adaptive Policies for Simultaneous Translation
Baigong Zheng, Renjie Zheng, Mingbo Ma +1
Simultaneous translation is widely useful but remains challenging. Previous work falls into two main categories: (a) fixed-latency policies such as Ma et al. (2019) and (b) adaptiv…
Robust Machine Translation with Domain Sensitive Pseudo-Sources: Baidu-OSU WMT19 MT Robustness Shared Task System Report
Renjie Zheng, Hairong Liu, Mingbo Ma +2
This paper describes the machine translation system developed jointly by Baidu Research and Oregon State University for WMT 2019 Machine Translation Robustness Shared Task. Transla…
Simultaneous Translation with Flexible Policy via Restricted Imitation Learning
Baigong Zheng, Renjie Zheng, Mingbo Ma +1
Simultaneous translation is widely useful but remains one of the most difficult tasks in NLP. Previous work either uses fixed-latency policies, or train a complicated two-staged mo…
Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs
Glencora Borradaile, Hung Le, Baigong Zheng
We present two algorithms for the minimum feedback vertex set problem in planar graphs: an PTAS using a linear kernel and balanced separator, and a heuristic algorith…
Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs
Hung Le, Baigong Zheng
We show that a simple local search gives a PTAS for the Feedback Vertex Set (FVS) problem in minor-free graphs. An efficient PTAS in minor-free graphs was known for this problem by…
Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
Baigong Zheng
We present the first polynomial-time approximation schemes, i.e., (1 + ε)-approximation algorithm for any constant ε > 0, for the minimum three-edge connected spanning subgraph pro…
A PTAS for Three-Edge Connectivity in Planar Graphs
Glencora Borradaile, Baigong Zheng
We consider the problem of finding the minimum-weight subgraph that satisfies given connectivity requirements. Specifically, given a requirement for every verte…
The crossing number of pancake graph is six
Yuansheng Yang, Bo Lv, Baigong Zheng +2
The {\it crossing number} of a graph is the least number of pairwise crossings of edges among all the drawings of in the plane. The pancake graph is an important topology f…
The crossing numbers of and
Yuansheng Yang, Baigong Zheng, Xirong Xu +1
The {\it crossing number} of a graph is the minimum number of pairwise intersections of edges in a drawing of . In this paper, we study the crossing numbers of $K_{m}\times…
The crossing number of the generalized Petersen graph P(10, 3) is six
Yuansheng Yang, Baigong Zheng, Xirong Xu
The crossing number of a graph is the least number of crossings of edges among all drawings of the graph in the plane. In this article, we prove that the crossing number of the gen…
The crossing numbers of , , and
Yuansheng Yang, Baigong Zheng, Xiaohui Lin +1
The crossing number of a graph is the minimum number of pairwise intersections of edges among all drawings of . In this paper, we study the crossing number of …
An upper bound for the crossing number of bubble-sort graph Bn
Baigong Zheng, Yuansheng Yang, Xirong Xu
The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora,…