Sciweavers

1568 search results - page 9 / 314
» The problem of examination questions in algorithmics
Sort
View
RANLP
2003
13 years 8 months ago
Combining independent modules in lexical multiple-choice problems
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
Peter D. Turney, Michael L. Littman, Jeffrey Bigha...
COMPGEOM
2004
ACM
14 years 25 days ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
TREC
2004
13 years 8 months ago
Combining Linguistic Processing and Web Mining for Question Answering: ITC-irst at TREC 2004
This paper describes the work we have been done in the last year on the DIOGENE Question Answering system developed at ITC-Irst. We present two preliminary experiments showing the...
Hristo Tanev, Milen Kouylekov, Bernardo Magnini
TREC
2003
13 years 8 months ago
Passage Scoring for Question Answering via Bayesian Inference on Lexical Relations
Many researchers have used lexical networks and ontologies to mitigate synonymy and polysemy problems in Question Answering (QA), systems coupled with taggers, query classifiers,...
Deepa Paranjpe, Ganesh Ramakrishnan, Sumana Sriniv...
SIGIR
2003
ACM
14 years 19 days ago
Structured use of external knowledge for event-based open domain question answering
One of the major problems in question answering (QA) is that the queries are either too brief or often do not contain most relevant terms in the target corpus. In order to overcom...
Hui Yang, Tat-Seng Chua, Shuguang Wang, Chun-Keat ...