10909 search results - page 615 / 2182 » Evaluating Backup Algorithms |
180
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
188
click to vote
COLING
2008
15 years 8 months ago
2008
Query-oriented update summarization is an emerging summarization task very recently. It brings new challenges to the sentence ranking algorithms that require not only to locate th...
142
Voted
IIR
2010
15 years 8 months ago
2010
In this work we propose a comparative study of the effects of a continuous model update on the effectiveness of wellknown query recommendation algorithms. In their original formul...
184
click to vote
EMNLP
2007
15 years 8 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
176
click to vote
ACL
2004
15 years 8 months ago
2004
Supervised learning methods for WSD yield better performance than unsupervised methods. Yet the availability of clean training data for the former is still a severe challenge. In ...