64 search results - page 4 / 13 » Analysis of evolutionary algorithms for the longest common s... |
121
click to vote
JDA
2008
15 years 3 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, ...
103
click to vote
CTRSA
2009
Springer
15 years 7 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...
119
Voted
IJCAI
2007
15 years 4 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...
151
Voted
CATA
2006
15 years 4 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...
109
Voted
SPIRE
2007
Springer
15 years 9 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...