Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
The preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan is studied. An algorithm to find a schedule of length greater than the optimal schedule length is also discussed. The results showed that the maximum job length is bounded by a constant and algorithm finds a schedule whose length is within an additive constant of the optimal length.
B.K. Boguraev, Mary S. Neff
HICSS 2000
Qing Li, Zhigang Deng, et al.
IEEE T-MI
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011