231 search results - page 12 / 47 » Sublinear time approximate clustering |
135
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
119
click to vote
COCOON
2010
Springer
15 years 8 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...
133
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
113
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
117
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...