906 search results - page 33 / 182 » Matching Subsequences in Trees |
DIS
2006
Springer
13 years 11 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
COMBINATORICS
2006
13 years 7 months ago
2006
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
DIS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Group comparison per se is a fundamental task in many scientific endeavours but is also the basis of any classifier. Contrast sets and emerging patterns contrast betwee...
ICCV
2009
IEEE
15 years 20 days ago
2009
IEEE
A prototype-based approach is introduced for action
recognition. The approach represents an action as a se-
quence of prototypes for efficient and flexible action match-
ing in ...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...