1862 search results - page 133 / 373 » Constrained pattern matching |
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
119
click to vote
ENTCS
2008
15 years 1 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
110
click to vote
ACISICIS
2009
IEEE
15 years 4 months ago
2009
IEEE
Temporal representation and reasoning plays an important role in Data Mining and Knowledge Discovery, particularly, in mining and recognizing patterns with rich temporal informati...
PR
2010
14 years 11 months ago
2010
This paper presents a classification approach, where a sample is represented by a set of feature vectors called an attributed point pattern. Some attributes of a point are transf...
102
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...