5595 search results - page 442 / 1119 » Approximation Algorithms for Clustering Problems |
212
click to vote
IJCV
2011
15 years 1 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
186
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
193
click to vote
NIPS
2004
15 years 8 months ago
2004
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
178
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
178
click to vote
STRINGOLOGY
2004
15 years 8 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...