Sciweavers

5595 search results - page 1 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
15 years 8 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
203
Voted
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 11 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
154
Voted
STOC
1999
ACM
74views Algorithms» more  STOC 1999»
15 years 11 months ago
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
Allan Borodin, Rafail Ostrovsky, Yuval Rabani
155
Voted
IWANN
2005
Springer
16 years 15 days ago
Improving Clustering Technique for Functional Approximation Problem Using Fuzzy Logic: ICFA Algorithm
Alberto Guillén, Ignacio Rojas, Jesú...