Given the increasing need to process massive amounts of textual data, efficiency of NLP tools is becoming a pressing concern. Parsers based on lexicalised grammar formalisms, such...
Yue Zhang 0004, Byung-Gyu Ahn, Stephen Clark, Curt...
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
The aim of this paper is to investigate the multiple attribute decision making problems with intuitionistic fuzzy information, in which the information about attribute weights is ...