2440 search results - page 213 / 488 » Data-Intensive Question Answering |
127
click to vote
ENTCS
2008
15 years 4 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...
148
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Topic detection is a task that automatically identifies topics (e.g., "biochemistry" and "protein structure") in scientific articles based on infor...
115
click to vote
COMBINATORICA
2006
15 years 4 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...
101
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function R(D), then we can transmit this source to within a distortion D. We answer th...
124
click to vote
EJC
2006
15 years 4 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...