The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
Abstract. We present a novel shape recognition method based on an algorithm to detect contrasted level lines for extraction, on Shape Context for encoding and on an a contrario app...
This paper compares two methods for object localization from contours: shape context and chamfer matching of templates. In the light of our experiments, we suggest improvements to...
Arasanathan Thayananthan, Bjoern Stenger, Philip H...