606 search results - page 33 / 122 » Answer Diversification for Complex Question Answering on the... |
102
click to vote
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
105
click to vote
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
ORL
2007
15 years 1 months ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
EMNLP
2006
15 years 3 months ago
2006
Complex tasks like question answering need to be able to identify events in text and the relations among those events. We show that this event identification task and a related ta...
139
click to vote
WWW
2011
ACM
14 years 8 months ago
2011
ACM
Recently answers for fact lookup queries have appeared on major search engines. For example, for the query {Barack Obama date of birth} Google directly shows “4 August 1961” a...