1421 search results - page 19 / 285 » Algorithms for subsequence combinatorics |
JDA
2008
14 years 9 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
1999
ACM
15 years 1 months ago
1999
ACM
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
101
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
As learning agents move from research labs to the real world, it is increasingly important that human users, including those without programming skills, be able to teach agents de...
101
click to vote
KDD
2012
ACM
12 years 12 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
EMNLP
2008
14 years 11 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...