388 search results - page 18 / 78 » An approximate algorithm for median graph computation using ... |
PODC
2012
ACM
11 years 10 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
CSCLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
STOC
2010
ACM
13 years 12 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...