779 search results - page 13 / 156 » Algorithms for the Sample Mean of Graphs |
121
click to vote
JCB
2002
14 years 9 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
147
click to vote
ECCV
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
ALENEX
2007
14 years 11 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
DM
2008
14 years 9 months ago
2008
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
106
click to vote
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...