10054 search results - page 376 / 2011 » On the Complexity of Function Learning |
130
click to vote
ICISC
2007
15 years 5 months ago
2007
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
127
click to vote
NIPS
1994
15 years 5 months ago
1994
Ideally pattern recognition machines provide constant output when the inputs are transformed under a group G of desired invariances. These invariances can be achieved by enhancing...
133
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
162
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
149
click to vote
ICIC
2009
Springer
15 years 11 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...