24554 search results - page 253 / 4911 » Dependable distributed systems |
248
click to vote
EMNLP
2007
15 years 8 months ago
2007
We present experiments with a dependency parsing model defined on rich factors. Our model represents dependency trees with factors that include three types of relations between t...
144
click to vote
COLING
2008
15 years 8 months ago
2008
In this paper, we focus on the adaptation problem that has a large labeled data in the source domain and a large but unlabeled data in the target domain. Our aim is to learn relia...
182
click to vote
JAR
2006
15 years 6 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
168
click to vote
FASE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challeng...
158
click to vote
RR
2009
Springer
16 years 1 months ago
2009
Springer
Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches ...