Abstract. A method is proposed to determine the similarity of a collection of time series. As a first step, one extracts events from the time series, in other words, one converts e...
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
This paper explores the visualization of two-dimensional stable and unstable manifolds of the origin (a saddle point) in a four-dimensional Hamiltonian system arising from control...
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
Mean shift clustering is a powerful unsupervised data
analysis technique which does not require prior knowledge
of the number of clusters, and does not constrain the shape
of th...