146 search results - page 19 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
COLT
2003
Springer
14 years 4 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
ENTCS
2002
13 years 10 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
DCC
2011
IEEE
13 years 5 months ago
2011
IEEE
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...
LREC
2008
14 years 10 days ago
2008
Discourse structure and coherence relations are one of the main inferential challenges addressed by computational pragmatics. The present study focuses on discourse markers as key...