224 search results - page 7 / 45 » G-graphs for the cage problem: a new upper bound |
157
click to vote
CIARP
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
182
click to vote
ANOR
2008
15 years 6 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...
151
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
157
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
170
click to vote
ICANN
1997
Springer
15 years 10 months ago
1997
Springer
A new boosting algorithm ADABOOST-R for regression problems is presented and upper bound on the error is obtained. Experimental results to compare ADABOOST-R and other learning alg...