Sciweavers

2435 search results - page 125 / 487
» Intellexer Question Answering
Sort
View
123
Voted
CLEF
2008
Springer
15 years 5 months ago
Answer Validation on English and Romanian Languages
The present article presents the steps involved in the transformation of the TE system that was used in the RTE3 competition in 2007 for the AVE 2008 exercise. We describe the rule...
Adrian Iftene, Alexandra Balahur
133
Voted
TREC
2004
15 years 5 months ago
Using Wikipedia at the TREC QA Track
: We describe our participation in the TREC 2004 Question Answering track. We provide a detailed account of the ideas underlying our approach to the QA task, especially to the so-c...
David Ahn, Valentin Jijkoun, Gilad Mishne, Karin M...
108
Voted
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
16 years 3 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
ICDCN
2010
Springer
15 years 10 months ago
A Leader-Free Byzantine Consensus Algorithm
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
Fatemeh Borran, André Schiper
122
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
No Syllogisms for the Numerical Syllogistic
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
Ian Pratt-Hartmann