2 papers
cs.CG2026
A Certified Lower Bound for Lebesgue's Universal Cover Problem
Niantao Xie
Lebesgue's universal cover problem asks for the infimum of the areas of planar sets that contain a congruent copy of every planar set of diameter at most one. We work in the convex…
cs.CL2018
Abstractive Summarization Improved by WordNet-based Extractive Sentences
Niantao Xie, Sujian Li, Huiling Ren +1
Recently, the seq2seq abstractive summarization models have achieved good results on the CNN/Daily Mail dataset. Still, how to improve abstractive methods with extractive methods i…