1414 search results - page 33 / 283 » Randomness and Universal Machines |
ALT
2007
Springer
14 years 2 months ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
SSPR
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Statistical analysis of spatially uniform signal contexts allows Discrete Universal Denoiser (DUDE) to effectively correct signal errors caused by a discrete symmetric me...
ACNS
2004
Springer
14 years 12 days ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
MFCS
2000
Springer
14 years 6 days ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...