17 search results - page 4 / 4 » Approximating min-max k-clustering |
PR
2008
13 years 5 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
DICTA
2003
13 years 7 months ago
2003
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...