1222 search results - page 86 / 245 » corr 2008 |
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
133
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Let X be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer n and any x1, . . . , xn X there exists a linear ma...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We generalize a result in [8] and derive an asymptotic formula for entropy rate of a hidden Markov chain around a "weak Black Hole". We also discuss applications of the ...