3875 search results - page 340 / 775 » Approximation algorithms for the 0-extension problem |
200
click to vote
ICIP
2010
IEEE
2010
IEEE
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
15 years 4 months ago
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
188
click to vote
AUSAI
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
203
click to vote
TEC
2010
15 years 1 months ago
2010
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
200
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
176
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...