1421 search results - page 22 / 285 » Algorithms for subsequence combinatorics |
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
IJCAI
2007
14 years 11 months ago
2007
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
COMBINATORICS
2006
14 years 9 months ago
2006
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
COMBINATORICS
2006
14 years 9 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...