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...
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
Christopher J. C. Burges, Tal Shaked, Erin Renshaw...
In this paper, a method to generalize previously proposed Chebyshev Kernel function is presented for Support Vector Classification in order to obtain more robust and higher classi...
This paper presents a technique, which determines whether an edge is visible for a human eye or not. First, a threshold function is built according to the optical characteristics ...