2440 search results - page 150 / 488 » Data-Intensive Question Answering |
STOC
2001
ACM
14 years 10 months ago
2001
ACM
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...
ICDCN
2010
Springer
14 years 5 months ago
2010
Springer
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...
BIRTHDAY
2009
Springer
14 years 4 months ago
2009
Springer
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...
BRAIN
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper, we want to farther advance the parallelism between models of the brain and computing machines. We want to apply the same idea underlying neuroimaging techn...
ECOOPW
1999
Springer
14 years 2 months ago
1999
Springer
This paper reports the results of a workshop held at ECOOP’99. The workshop was set up to find answers to questions fundamental to the definition of a semantics for the Unifie...