541 search results - page 2 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
CATA
2006
13 years 6 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
CTRSA
2009
Springer
13 years 9 months ago
2009
Springer
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
CSR
2006
Springer
13 years 9 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
JDA
2008
13 years 5 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
KDD
2000
ACM
13 years 9 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...