5214 search results - page 284 / 1043 » The Online Specialization Problem |
180
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
149
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...
157
click to vote
SODA
1990
ACM
15 years 7 months ago
1990
ACM
We investigate 3-d visibility problems in which the viewing position moves along a straight flightpath. Specifically we focus on two problems: determining the points along the fli...
176
click to vote
SIAMJO
2000
15 years 6 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
163
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...