541 search results - page 80 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
AI
2010
Springer
13 years 8 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
GIS
2008
ACM
14 years 9 months ago
2008
ACM
d Abstract] K. Buchin Dept. Computer Science Utrecht University The Netherlands buchin@cs.uu.nl M. Buchin Dept. Computer Science Utrecht University The Netherlands maike@cs.uu.nl ...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
VLSID
2002
IEEE
14 years 9 months ago
2002
IEEE
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...