2475 search results - page 186 / 495 » Question Answering in TREC |
151
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Schema mappings define relationships between schemas in a declarative way. We demonstrate MVT, a mapping validation tool that allows the designer to ask whether the mapping has ce...
152
click to vote
CLEF
2006
Springer
15 years 10 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...
169
click to vote
IVC
2008
15 years 6 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...
148
click to vote
JSYML
2007
15 years 6 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...
160
click to vote
NDJFL
1998
15 years 6 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 ...