1806 search results - page 294 / 362 » Randomness and halting probabilities |
115
Voted
ECCC
2010
15 years 3 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
151
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eige...
124
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
132
click to vote
JCC
2008
15 years 3 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— This paper studies a variant of the classical problem of “writing on dirty paper” in which the sum of the input and the interference, or dirt, is multiplied by a random var...