382 search results - page 2 / 77 » Dominant Sets and Hierarchical Clustering |
NIPS
2004
13 years 6 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
ADHOC
2005
13 years 5 months ago
2005
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
PAMI
2007
13 years 4 months ago
2007
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
MOBIHOC
2002
ACM
14 years 4 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
JPDC
2007
13 years 5 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...