262 search results - page 14 / 53 » Approximating the 2-Interval Pattern Problem |
SIBGRAPI
2005
IEEE
14 years 3 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
MCS
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we propose a numerical method for approximating the product of a matrix function with multiple vectors by Krylov subspace methods combined with a QR decomposition of...
JMLR
2006
13 years 9 months ago
2006
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
Constraint-based mining has been proven to be extremely useful for supporting actionable pattern discovery. However, useful conjunctions of constraints that support domain driven ...