Community detection in social networks varying with time is a common yet challenging problem whereby efficient visualization of evolving relationships and implicit hierarchical s...
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...
A hierarchical extension of the finite mixture model is presented that can be used for the analysis of nested data structures. The model permits a simultaneous model-based cluster...
Clustering is an important characteristic of most sensor applications. In this paper we define COSMOS, the Cluster-based, heterOgeneouS MOdel for Sensor networks. The model assum...