1421 search results - page 23 / 285 » Algorithms for subsequence combinatorics |
COMBINATORICS
2002
14 years 9 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
112
click to vote
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
COMBINATORICS
2004
14 years 9 months ago
2004
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
ICDM
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
TC
2002
14 years 9 months ago
2002