Sciweavers

65 search results - page 4 / 13
» Regular Tree Language Recognition with Static Information
Sort
View
HIS
2009
13 years 5 months ago
Implementing and Evaluating a Rule-Based Approach to Querying Regular EL+ Ontologies
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
Yuting Zhao, Jeff Z. Pan, Yuan Ren
CIKM
2008
Springer
13 years 9 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
GW
2007
Springer
135views Biometrics» more  GW 2007»
14 years 1 months ago
Enhancing a Sign Language Translation System with Vision-Based Features
Abstract. In automatic sign language translation, one of the main problems is the usage of spatial information in sign language and its proper representation and translation, e.g. ...
Philippe Dreuw, Daniel Stein, Hermann Ney
ECOOP
2005
Springer
14 years 27 days ago
Expressive Pointcuts for Increased Modularity
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...
Klaus Ostermann, Mira Mezini, Christoph Bockisch
DOCENG
2009
ACM
14 years 1 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...