1389 search results - page 230 / 278 » Improved Approximation Algorithms for Label Cover Problems |
121
Voted
PAMI
2008
15 years 2 months ago
2008
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
111
Voted
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
153
Voted
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
138
Voted
SIAMJO
2000
15 years 2 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
162
Voted
IJCNN
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...