Sciweavers

583 search results - page 25 / 117
» Finding Answers to Complex Questions
Sort
View
LREC
2010
132views Education» more  LREC 2010»
13 years 9 months ago
A Question-answer Distance Measure to Investigate QA System Progress
The performance of question answering system is evaluated through successive evaluations campaigns. A set of questions are given to the participating systems which are to find the...
Guillaume Bernard, Sophie Rosset, Martine Adda-Dec...
JSYML
2007
95views more  JSYML 2007»
13 years 7 months ago
Applications of Kolmogorov complexity to computable model theory
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...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf