5595 search results - page 157 / 1119 » Approximation Algorithms for Clustering Problems |
127
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
132
click to vote
COLT
2010
Springer
15 years 3 months ago
2010
Springer
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...
123
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
149
click to vote
FCT
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
159
Voted
SIAMJO
2008
15 years 5 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...