2126 search results - page 90 / 426 » An optimization algorithm for imprecise multi-objective prob... |
149
click to vote
CIMAGING
2008
15 years 6 months ago
2008
We consider the image reconstruction problem when the original image is assumed to be sparse and when partial knowledge of the point spread function (PSF) is available. In particu...
188
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
148
click to vote
CEC
2008
IEEE
15 years 5 months ago
2008
IEEE
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...
146
click to vote
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
146
click to vote
ALT
2004
Springer
16 years 1 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...