1058 search results - page 6 / 212 » It's Doomed; We Can Prove It |
TIT
2010
13 years 4 months ago
2010
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
TIT
2008
13 years 9 months ago
2008
One-to-one codes are "one shot" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For ex...
ICML
2001
IEEE
14 years 10 months ago
2001
IEEE
This paper examines the notion of symmetry in Markov decision processes (MDPs). We define symmetry for an MDP and show how it can be exploited for more effective learning in singl...
DCG
2007
13 years 9 months ago
2007
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
CICLING
2003
Springer
14 years 3 months ago
2003
Springer
NLPsystem developers and corpus lexicographers would both bene t from a tool for nding and organizing the distinctive patterns of use of words in texts. Such a tool would be an ass...