Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Abstract—In this paper, two general algorithms for the automatic generation of instruction-set extensions are presented. The basic instruction set of a reconfigurable architectu...
Carlo Galuzzi, Dimitris Theodoropoulos, Roel Meeuw...
In this paper, a new segmentation approach for sets of 3D unorganized points is proposed. The method is based on a clustering procedure that separates the modes of a non-parametri...
Umberto Castellani, Marco Cristani, Vittorio Murin...
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...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
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...