2994 search results - page 419 / 599 » Time sequences |
184
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
157
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
122
click to vote
FORMATS
2008
Springer
15 years 5 months ago
2008
Springer
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
148
click to vote
PDPTA
2004
15 years 4 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
140
Voted
WSC
2001
15 years 4 months ago
2001
Recent trends in automotive manufacturing have increased the focus on the Just-In-Time (JIT) delivery of automotive components. By requiring smaller batches of parts delivered mor...