441 search results - page 6 / 89 » Optimal Subsequence Bijection |
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
BIOCOMP
2006
14 years 11 months ago
2006
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
107
click to vote
ICCTA
2007
IEEE
15 years 1 months ago
2007
IEEE
The variables of the high-level specifications and the automatically generated temporary variables are mapped on to the data-path registers during data-path synthesis phase of hig...
COMBINATORICS
2004
14 years 9 months ago
2004
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
DIS
2001
Springer
15 years 2 months ago
2001
Springer
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...