297 search results - page 35 / 60 » Every Sequence Is Decompressible from a Random One |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract-- The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y , the relay output Y1 = f(X, Y ), and a separate communicatio...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
103
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
102
click to vote
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
BMCBI
2007
14 years 11 months ago
2007
Background: The main two sorts of automatic gene annotation frameworks are ab initio and alignment-based, the latter splitting into two sub-groups. The first group is used for int...