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...
We propose an algorithm for automated segmentation of white matter in brain MRI images, which can be used to create connected representations of the gray matter in the cerebral co...
Gowri Srinivasa, Vivek S. Oak, Siddharth J. Garg, ...
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
—We introduce a novel set of social network analysis based algorithms for mining the Web, blogs, and online forums to identify trends and find the people launching these new tren...
Peter A. Gloor, Jonas Krauss, Stefan Nann, Kai Fis...