53 search results - page 8 / 11 » Maximal Lattice-Free Convex Sets in Linear Subspaces |
ECML
2007
Springer
14 years 1 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 ...
SIAMREV
2010
13 years 1 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
FMSD
2006
13 years 7 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
IJCAI
2003
13 years 8 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...