5595 search results - page 382 / 1119 » Approximation Algorithms for Clustering Problems |
173
click to vote
WABI
2007
Springer
16 years 27 days ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
154
click to vote
AAIM
2007
Springer
16 years 1 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
187
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
188
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
194
click to vote
DAGM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...