We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
The paper considers distributed applications where interactions between constituent services take place via messages in an asynchronous environment with unpredictable communicatio...
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
In this research, we re-arrange FIPA’s ACL performatives to form a subsumption lattice (ontology) and apply a theory of social commitments to achieve a simplified and observable...