2440 search results - page 177 / 488 » Data-Intensive Question Answering |
120
click to vote
CLEF
2006
Springer
15 years 7 months ago
2006
Springer
We describe a method for recognizing textual entailment that uses the length of the longest common subsequence (LCS) between two texts as its decision criterion. Rather than requi...
132
click to vote
IVC
2008
15 years 4 months ago
2008
In this paper, we are going to answer the following question: assuming that we have estimates for the epipolar geometry and its uncertainty between two views, how probable it is t...
116
click to vote
JSYML
2007
15 years 4 months ago
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
125
click to vote
NDJFL
1998
15 years 3 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
133
click to vote
JMLR
2010
14 years 11 months ago
2010
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...