701 search results - page 27 / 141 » Self Bounding Learning Algorithms |
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— To enable real-time and robust message delivery, the highly mobile Vehicular Ad Hoc Networks (VANETs) call for comprehensive investigation on the dynamic power control effects ...
ECCC
2010
13 years 8 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
ICONIP
2004
13 years 11 months ago
2004
Abstract. This paper presents a neural-evolutionary framework for the simulation of market models in a bounded rationality scenario. Each agent involved in the scenario make use of...
AI
1998
Springer
13 years 9 months ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...