2435 search results - page 441 / 487 » Question Answering in Webclopedia |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
ACL
2007
14 years 11 months ago
2007
While the average performance of statistical parsers gradually improves, they still attach to many sentences annotations of rather low quality. The number of such sentences grows ...
CAINE
2008
14 years 11 months ago
2008
- The objective of this paper is to present a graphical-user-interface (GUI) in support of a decision support system (KASER) for machine understanding. In order to provide informat...
COLING
2008
14 years 11 months ago
2008
The ability to correctly classify sentences that describe events is an important task for many natural language applications such as Question Answering (QA) and Summarisation. In ...