848 search results - page 127 / 170 » Randomness and the linear degrees of computability |
105
click to vote
MOBIHOC
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
157
click to vote
RECOMB
2002
Springer
16 years 4 days ago
2002
Springer
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
100
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
DCG
2006
14 years 12 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
BIRD
2008
Springer
15 years 1 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...