Sciweavers

1414 search results - page 8 / 283
» Randomness and Universal Machines
Sort
View
FOCS
2002
IEEE
15 years 4 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
TIT
1998
50views more  TIT 1998»
14 years 11 months ago
Memory-Universal Prediction of Stationary Random Processes
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
Dharmendra S. Modha, Elias Masry
ALT
2006
Springer
15 years 8 months ago
On Exact Learning from Random Walk
Nader H. Bshouty, Iddo Bentov
ICML
2010
IEEE
15 years 23 days ago
Learning Tree Conditional Random Fields
Joseph K. Bradley, Carlos Guestrin