5595 search results - page 355 / 1119 » Approximation Algorithms for Clustering Problems |
176
click to vote
FORMATS
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
188
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
152
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
182
click to vote
SSPR
2004
Springer
16 years 3 days ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
193
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...