Sciweavers

388 search results - page 24 / 78
» Convergence Properties of the K-Means Algorithms
Sort
View
MP
2002
84views more  MP 2002»
15 years 29 days ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
ICPR
2008
IEEE
16 years 2 months ago
Accelerating active contour algorithms with the Gradient Diffusion Field
Active contours were proposed by Kass et al. as a way to represent the contours of an image. Although the method is simple, one of its shortcomings is its inability to converge in...
Willie Kiser, Pradeep Sen, Chris Musial
TIP
2008
104views more  TIP 2008»
15 years 1 months ago
A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
Cédric Vonesch, Michael Unser
WSC
2007
15 years 3 months ago
Stochastic trust region gradient-free method (strong): a new response-surface-based algorithm in simulation optimization
Response Surface Methodology (RSM) is a metamodelbased optimization method. Its strategy is to explore small subregions of the parameter space in succession instead of attempting ...
Kuo-Hao Chang, L. Jeff Hong, Hong Wan
COLT
2005
Springer
15 years 6 months ago
Stability and Generalization of Bipartite Ranking Algorithms
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Partha Niyogi