118 search results - page 3 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
125
Voted
WDAG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
116
Voted
ALT
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
145
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
117
Voted
BROADNETS
2004
IEEE
15 years 7 months ago
2004
IEEE
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
119
Voted
BIODATAMINING
2008
15 years 3 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...