130 search results - page 20 / 26 » Question answering passage retrieval using dependency relati... |
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
ACL
2010
14 years 9 months ago
2010
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...
114
click to vote
AAAI
2007
15 years 2 months ago
2007
The long-term goal of Project Halo is to build an application called Digital Aristotle that can answer questions on a variety of science topics and provide user and domain appropr...
FSE
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
LREC
2010
15 years 1 months ago
2010
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstr...