Sciweavers

1092 search results - page 67 / 219
» Convex Methods for Transduction
Sort
View
JMLR
2006
93views more  JMLR 2006»
13 years 10 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
SIAMJO
2008
136views more  SIAMJO 2008»
13 years 9 months ago
Relaxed Alternating Projection Methods
Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
Andrzej Cegielski, Agnieszka Suchocka
JMLR
2010
161views more  JMLR 2010»
13 years 4 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
SMI
2007
IEEE
106views Image Analysis» more  SMI 2007»
14 years 4 months ago
Iterative Methods for Improving Mesh Parameterizations
We present two complementary methods for automatically improving mesh parameterizations and demonstrate that they provide a very desirable combination of efficiency and quality. ...
Shen Dong, Michael Garland
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
13 years 11 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...