4009 search results - page 139 / 802 » Clustering on Complex Graphs |
113
Voted
LCN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
156
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
133
click to vote
CIVR
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
189
click to vote
ACCV
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
127
Voted
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...