754 search results - page 16 / 151 » Robust information-theoretic clustering |
CLUSTER
2005
IEEE
15 years 3 months ago
2005
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
BMVC
1998
14 years 11 months ago
1998
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...
CLUSTER
2007
IEEE
15 years 4 months ago
2007
IEEE
— A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led ...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
AMW
2010
14 years 11 months ago
2010
Discovering the patterns in evolving data streams is a very important and challenging task. In many applications, it is useful to detect the dierent patterns evolving over time and...