Shinsaku Sakaue, Tsutomu Hirao, Masaaki Nishino, Masaaki Nagata. Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function. In Marilyn A. Walker, Heng Ji, Amanda Stent, editors, Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2018, New Orleans, Louisiana, USA, June 1-6, 2018, Volume 1 (Long Papers). pages 1737-1746, Association for Computational Linguistics, 2018. [doi]
@inproceedings{SakaueHNN18,
title = {Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function},
author = {Shinsaku Sakaue and Tsutomu Hirao and Masaaki Nishino and Masaaki Nagata},
year = {2018},
url = {https://aclanthology.info/papers/N18-1157/n18-1157},
researchr = {https://researchr.org/publication/SakaueHNN18},
cites = {0},
citedby = {0},
pages = {1737-1746},
booktitle = {Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2018, New Orleans, Louisiana, USA, June 1-6, 2018, Volume 1 (Long Papers)},
editor = {Marilyn A. Walker and Heng Ji and Amanda Stent},
publisher = {Association for Computational Linguistics},
isbn = {978-1-948087-27-8},
}