Sciweavers

90 search results - page 2 / 18
» A nontangential cutting plane algorithm
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 9 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
CC
2007
Springer
107views System Software» more  CC 2007»
14 years 1 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
Daniel Grund, Sebastian Hack
ICML
2008
IEEE
14 years 8 months ago
Optimized cutting plane algorithm for support vector machines
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
Sören Sonnenburg, Vojtech Franc