118 search results - page 7 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
76
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
KDD
1997
ACM
15 years 1 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
69
Voted
COMGEO
2010
ACM
14 years 9 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...