346 search results - page 13 / 70 » A New Approximate Maximal Margin Classification Algorithm |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
NIPS
2003
13 years 8 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
SIAMJO
2008
13 years 7 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
CIVR
2008
Springer
13 years 9 months ago
2008
Springer
As the consequence of semantic gap, visual similarity does not guarantee semantic similarity, which in general is conflicting with the inherent assumption of many generativebased ...