352 search results - page 4 / 71 » Fast Graph Pattern Matching |
PVLDB
2010
13 years 6 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...
GBRPR
2009
Springer
14 years 2 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...