8600 search results - page 301 / 1720 » Measuring with Timed Patterns |
129
Voted
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
131
Voted
IEICET
2008
15 years 3 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
129
Voted
AOSD
2008
ACM
15 years 5 months ago
2008
ACM
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
134
Voted
RTCSA
2006
IEEE
15 years 9 months ago
2006
IEEE
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
145
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...