Sciweavers

4 search results - page 1 / 1
» Unbiased Random Sequences from Quasigroup String Transformat...
Sort
View
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
13 years 10 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 1 months ago
On extracting common random bits from correlated sources
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
Andrej Bogdanov, Elchanan Mossel
MST
2006
104views more  MST 2006»
13 years 5 months ago
Sequencing from Compomers: The Puzzle
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...
Sebastian Böcker
FOCS
1990
IEEE
13 years 9 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum