906 search results - page 81 / 182 » Matching Subsequences in Trees |
SCAM
2003
IEEE
14 years 2 months ago
2003
IEEE
Software maintenance, program analysis and transformation tools almost always rely on static source code analysis as the first and fundamental step to gather information. In the ...
ACID
2006
13 years 10 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
FLAIRS
2004
13 years 10 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
ICMCS
2009
IEEE
13 years 6 months ago
2009
IEEE
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
CVPR
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper we propose an approach for action recognition based on a vocabulary forest of local motionappearance features. Large numbers of features with associated motion vecto...