Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
We have successfully adapted and extended the automatic Multilingual, Interoperable Named Entity Lexicon approach to Arabic, using Arabic WordNet (AWN) and Arabic Wikipedia (AWK)....
Mohammed Attia, Antonio Toral, Lamia Tounsi, Monic...
Abstract: We are developing a new mashup framework for creating flexible applications in which users can selectively browse through mashup items. The framework provides GUI compone...
Abstract. In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of pe...
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...