130 search results - page 7 / 26 » Secretary Problems via Linear Programming |
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
JMLR
2010
13 years 5 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
AUTOMATICA
2008
13 years 7 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
INFORMS
1998
13 years 7 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...