1056 search results - page 40 / 212 » Constraint-Based Graph Matching |
126
click to vote
PRL
2011
14 years 3 months ago
2011
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
89
Voted
BIRD
2008
Springer
15 years 2 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
115
Voted
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
129
click to vote
ICASSP
2010
IEEE
15 years 20 days ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
96
Voted
GBRPR
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...