2600 search results - page 57 / 520 » Clustering with or without the Approximation |
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
103
click to vote
DEXAW
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider topic detection without any prior knowledge of category structure or possible categories. Keywords are extracted and clustered based on different similarity measures u...