Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
The classical algorithm for testing unique decipherability of codes is improved by using McCreight’s algorithm for constructing suffix trees. The complexity of the algorithm is O(nm) where n is the number of codewords and m is their total length. Efficiency is gained by avoiding repeatedly comparing subwords of the codewords. © 1982. IEEE. All rights reserved.
B.K. Boguraev, Mary S. Neff
HICSS 2000
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
B. Wagle
EJOR