441 search results - page 3 / 89 » Optimal Subsequence Bijection |
CAD
2007
Springer
13 years 5 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
Recent approaches to action classification in videos have used sparse spatio-temporal words encoding local appearance around interesting movements. Most of these approaches use a ...
SDM
2007
SIAM
13 years 7 months ago
2007
SIAM
In this paper, we explore the discriminating subsequencebased clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining p...
CSR
2006
Springer
13 years 9 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...