728 search results - page 38 / 146 » New Directions in Question Answering |
103
click to vote
CADE
2003
Springer
16 years 1 months ago
2003
Springer
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
103
click to vote
NCA
2003
IEEE
15 years 6 months ago
2003
IEEE
Scalable information retrieval systems are crucial to meeting the growing volumes of data. We describe work done to facilitate scalability by reducing duplication, providing integ...
137
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
ENTCS
2008
15 years 1 months ago
2008
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...
COMBINATORICA
2006
15 years 1 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...