31 search results - page 1 / 7 » Constrained LCS: Hardness and Approximation |
CPM
2008
Springer
13 years 6 months ago
2008
Springer
SPIRE
2010
Springer
13 years 2 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
IWLCS
2005
Springer
13 years 10 months ago
2005
Springer
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...