534 search results - page 5 / 107 » Power from Random Strings |
MST
2006
14 years 10 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
COLT
1992
Springer
15 years 2 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
TIT
2008
14 years 9 months ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
78
Voted
APPROX
2008
Springer
15 years 2 days ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...