Abstract. We present an approach based on clustering to segment renal arteries from 2D PC Cine MR images to measure blood velocity and flow. Such information are important in gradi...
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
: Music title identification is a key ingredient of contentbased electronic music distribution. Because of the lack of standards in music identification – or the lack of enforcem...
— In this paper, we study the problem of localization using relative-state estimates. It is shown, that when the same exteroceptive sensor measurement is processed for the comput...