Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
A new distributed depth-first-search algorithm is presented whose communication and time complexities are bounded by 3|E| and 2|V|, respectively. © 1988.
B.K. Boguraev, Mary S. Neff
HICSS 2000
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975