10054 search results - page 222 / 2011 » On the Complexity of Function Learning |
104
click to vote
CSR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
120
Voted
SACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
103
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— Making inferences and choosing appropriate responses based on incomplete, uncertainty and noisy data is challenging in financial settings particularly in bankruptcy de...
110
click to vote
ADC
2006
Springer
15 years 6 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
117
click to vote
NCI
2004
15 years 2 months ago
2004
This paper describes a method for hierarchical reinforcement learning in which high-level policies automatically discover subgoals, and low-level policies learn to specialize for ...