We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Abstract. The goal of this paper is to present computations investigating the "functorial" properties of Stark units, that is, how specific roots of Stark units from cert...
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
This paper addresses the initial shift problem in iterative learning control with system relative degree. The tracking error caused by nonzero initial shift is detected when apply...