Sciweavers

256 search results - page 3 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
89
Voted
STOC
1999
ACM
74views Algorithms» more  STOC 1999»
15 years 5 months ago
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
Allan Borodin, Rafail Ostrovsky, Yuval Rabani
78
Voted
IWANN
2005
Springer
15 years 6 months ago
Improving Clustering Technique for Functional Approximation Problem Using Fuzzy Logic: ICFA Algorithm
Alberto Guillén, Ignacio Rojas, Jesú...
88
Voted
COLT
1999
Springer
15 years 5 months ago
Approximation Algorithms for Clustering Problems
David B. Shmoys
95
Voted
ICPR
2008
IEEE
16 years 2 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
130
Voted
JCSS
2002
199views more  JCSS 2002»
15 years 24 days ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...