On last.fm: Taylor Swift photos and free music!
BNET Business Network:
BNET
TechRepublic
ZDNet

FREE Registration is required

Overview:

The work in this paper studies the theoretical and empirical properties of various global inference algorithms for multi-document summarization. The paper starts by defining a general framework and proving that inference in it is NP-hard. It then presents three algorithms: The first is a greedy approximate method, the second a dynamic programming approach based on solutions to the knapsack problem, and the third is an exact algorithm that uses an Integer Linear Programming formulation of the problem. The paper empirically evaluates all three algorithms and shows that, relative to the exact solution, the dynamic programming algorithm provides near optimal results with preferable scaling properties.

(Is this item miscategorized? Does it need more tags? Let us know.)

Format:PDFSize:185 KB
Date:Jan 2008
Pages:12
advertisement

White Papers, Webcasts, and Resources

Featured Training Courses

Meet Doc

Returning users: Log In Here!

Already registered on BNET, TechRepublic, or ZDNet? Simply log in.

Free Membership: Sign Up Now!

Sign up for a free membership today and get instant and unlimited access to one of the largest databases of white papers, webcasts, and casestudies anywhere. Your FREE membership allows you to:

  • Download an unlimited amount of content, including classic and current white papers, case studies, webcasts and more
  • Track content on your chosen topics of interest
  • Receive targeted email alerts when your favorite content is added
  • Save content for future reading
  • Receive our member newsletter

When you register to access this library, you allow us to share your information with companies that produce products or services featured in the library--so that such companies may contact you with information and offers regarding their products and services. This enables us to keep the library a free service. As a library registrant, you will receive a complimentary subscription to the ZDNet white paper newsletter and e-mail Must-Read News Alerts. You can unsubscribe from these at any time. By clicking the Sign up button, you indicate that you agree to our Terms and Conditions and have read and understand our Privacy Policy (updated).