701 search results - page 7 / 141 » Self Bounding Learning Algorithms |
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
MLDM
2007
Springer
14 years 1 months ago
2007
Springer
The color reduction in digital images is an active research area in digital image processing. In many applications such as image segmentation, analysis, compression and transmissio...
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper evaluates a self-organizing routing protocol for Ad Hoc network, called the NEUron Routing ALgorithm (NEURAL). NEURAL has been designed taking into account the learning...
AAAI
1997
13 years 8 months ago
1997
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...