40 search results - page 1 / 8 » Random Descent |
IJCNN
2007
IEEE
13 years 12 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
COMBINATORICS
2000
13 years 5 months ago
2000
In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the norma...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this paper, we are interested in the combinatorial analysis of the whole genome duplication - random loss model of genome rearrangement initiated in [8] and [7]. In this model,...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
