187 search results - page 38 / 38 » Improved Approximation of MAX-CUT on Graphs of Bounded Degre... |
IJCNN
2007
IEEE
13 years 11 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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...