Sciweavers

577 search results - page 70 / 116
» New interval methods for constrained global optimization
Sort
View
JMLR
2006
89views more  JMLR 2006»
15 years 3 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
124
Voted
SIAMJO
2008
112views more  SIAMJO 2008»
15 years 3 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...
122
Voted
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
15 years 10 months ago
A Support Vector Approach to Censored Targets
Censored targets, such as the time to events in survival analysis, can generally be represented by intervals on the real line. In this paper, we propose a novel support vector tec...
Pannagadatta K. Shivaswamy, Wei Chu, Martin Jansch...
ADAC
2008
193views more  ADAC 2008»
15 years 4 months ago
A constrained-optimization based half-quadratic algorithm for robustly fitting sets of linearly parametrized curves
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
136
Voted
IJCV
2006
262views more  IJCV 2006»
15 years 3 months ago
A Variational Model for Object Segmentation Using Boundary Information and Shape Prior Driven by the Mumford-Shah Functional
In this paper, we propose a new variational model to segment an object belonging to a given shape space using the active contour method, a geometric shape prior and the Mumford-Sha...
Xavier Bresson, Pierre Vandergheynst, Jean-Philipp...