697 search results - page 85 / 140 » Convex Functions on Discrete Sets |
ECML
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
ICRA
1994
IEEE
14 years 26 days ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...
JUCS
2007
13 years 8 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
ATMOS
2010
13 years 7 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...