DM
2010
13 years 9 months ago
2010
We show that for every x1, . . . , xn, y1, . . . , yn ∈ S1 there exists i ∈ {1, . . . , n} such that n k=1 d(xi, xk) ≤ n k=1 d(xi, yk), where S1 is the unit circle and d is ...
TIT
2008
13 years 10 months ago
2008
Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric key setting. Information theoretic bounds on the success probability...
UAI
1997
14 years 4 days ago
1997
Much recent research in decision theoretic planning has adopted Markov decision processes (MDPs) as the model of choice, and has attempted to make their solution more tractable by...