Sciweavers

573 search results - page 11 / 115
» Sentence generation as a planning problem
Sort
View
IPM
2008
75views more  IPM 2008»
13 years 8 months ago
Single-document and multi-document summarization techniques for email threads using sentence compression
We present two approaches to email thread summarization: Collective Message Summarization (CMS) applies a multi-document summarization approach, while Individual Message Summariza...
David M. Zajic, Bonnie J. Dorr, Jimmy J. Lin
AAAI
1994
13 years 10 months ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
FUIN
2010
102views more  FUIN 2010»
13 years 6 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
ECML
2005
Springer
14 years 2 months ago
Learning to Complete Sentences
Abstract. We consider the problem of predicting how a user will continue a given initial text fragment. Intuitively, our goal is to develop a “tab-complete” function for natura...
Steffen Bickel, Peter Haider, Tobias Scheffer
ER
2010
Springer
90views Database» more  ER 2010»
13 years 7 months ago
W-Ray: A Strategy to Publish Deep Web Geographic Data
Abstract. This paper introduces an approach to address the problem of accessing conventional and geographic data from the Deep Web. The approach relies on describing the relevant d...
Helena Piccinini, Melissa Lemos, Marco A. Casanova...