Sciweavers

564 search results - page 20 / 113
» Error-tolerant Tree Matching
Sort
View
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 1 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
ALT
2003
Springer
13 years 11 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
ICCV
2009
IEEE
15 years 11 days ago
Recognizing Actions by Shape-Motion Prototype Trees
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 ...
Zhe Lin, Zhuolin Jiang, Larry S. Davis
ICIP
2004
IEEE
14 years 9 months ago
Object recognition based on binary partition trees
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...
Oreste Salerno, Montse Pardàs, Verón...
RTA
2005
Springer
14 years 27 days ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...