1301 search results - page 43 / 261 » Bounded Version Vectors |
128
click to vote
AAAI
1997
15 years 5 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 ...
133
Voted
MFCS
1997
Springer
15 years 8 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
151
click to vote
ANOR
2008
15 years 4 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
129
click to vote
ML
2008
ACM
15 years 3 months ago
2008
ACM
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
138
Voted
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...