3786 search results - page 337 / 758 » Structure Comparison and Structure Patterns |
135
click to vote
RELMICS
2000
Springer
15 years 8 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
136
click to vote
FIMI
2004
15 years 6 months ago
2004
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
146
click to vote
IFIP12
2004
15 years 6 months ago
2004
Latent class models (LCM) represent the high dimensional data in a smaller dimensional space in terms of latent variables. They are able to automatically discover the patterns from...
120
click to vote
MVA
1992
15 years 6 months ago
1992
This paper describes the general structure of a full automated document analysis system for printed documents. The system is based on a character preclassification stage which red...
137
Voted
PR
2006
15 years 4 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...