165 search results - page 18 / 33 » Dominant Sets and Pairwise Clustering |
88
Voted
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
93
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper proposes a novel algorithm for categorization of action video sequences using unsupervised dual clustering. Given a video database, we extract motion information of act...
71
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Object detection in cluttered, natural scenes has a high
complexity since many local observations compete for object
hypotheses. Voting methods provide an efficient solution
to ...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
AAAI
2011
13 years 9 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...