417 search results - page 34 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
COLT
2000
Springer
14 years 25 days ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
AAECC
1993
Springer
14 years 18 days ago
1993
Springer
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
ICASSP
2011
IEEE
13 years 6 days ago
2011
IEEE
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...