4009 search results - page 139 / 802 » Clustering on Complex Graphs |
144
click to vote
LCN
2007
IEEE
16 years 21 days 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...
194
click to vote
ICDM
2007
IEEE
16 years 22 days 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...
165
click to vote
CIVR
2005
Springer
15 years 12 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...
253
Voted
ACCV
2009
Springer
15 years 11 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...
162
click to vote
ICPR
2010
IEEE
15 years 4 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...