536 search results - page 47 / 108 » Evaluating Metrical Phonology - a Computational- Empirical A... |
107
click to vote
NAACL
2010
14 years 11 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
105
click to vote
ACL
2012
13 years 3 months ago
2012
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused...
117
click to vote
FLAIRS
2008
15 years 3 months ago
2008
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
137
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
136
click to vote
ICAC
2009
IEEE
15 years 8 months ago
2009
IEEE
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...