5595 search results - page 263 / 1119 » Approximation Algorithms for Clustering Problems |
164
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
173
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
180
click to vote
ESANN
2008
15 years 8 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
161
click to vote
ESCIENCE
2006
IEEE
16 years 16 days ago
2006
IEEE
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...