11160 search results - page 102 / 2232 » Incompleteness in a General Setting |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We consider the general relay channel. For this setup, the best achievability result was derived by Cover and ElGamal, in theorem 6 of their paper from 1979. In this work we apply...
ICDT
2010
ACM
13 years 9 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
MA
2010
Springer
13 years 8 months ago
2010
Springer
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case ...
BMCBI
2010
13 years 10 months ago
2010
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
ECCC
2011
13 years 4 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...