Login / Signup
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
Wentao Ding
Junpeng Hu
Published in:
CoRR (2020)
Keyphrases
</>
branch and bound
probabilistic model
search algorithm
cost function
upper bound
branch and bound procedure
convex programming
lower bound
text classification
constraint satisfaction problems
combinatorial optimization
sentence compression