most citedA Difference-of-Convex Programming Approach With Parallel Branch-and-Bound For Sentence Compression Via A Hybrid Extractive Model

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.AI2020★ 4 cited

A Difference-of-Convex Programming Approach With Parallel Branch-and-Bound For Sentence Compression Via A Hybrid Extractive Model

Yi-Shuai Niu, Yu You, Wenxu Xu +3

Sentence compression is an important problem in natural language processing with wide applications in text summarization, search engine and human-AI interaction system etc. In this…