Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
The solution of separable closed queueing networks requires the evaluation of homogeneous multinomial expressions. The number of terms in those expressions grows combinatorially with the size of the network such that a direct summation may become impractical. An algorithm is given which does not show a combinatorial operation count. The algorithm is based on a generalization of Horner's rule for polynomials. It is also shown how mean queue size and throughput can be obtained at negligible extra cost once the normalization constant is evaluated. © 1975, ACM. All rights reserved.
B.K. Boguraev, Mary S. Neff
HICSS 2000
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Preeti Malakar, Thomas George, et al.
SC 2012
Zohar Feldman, Avishai Mandelbaum
WSC 2010