We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to i...
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
In this paper we present a visual education tool for efficient and effective learning. The toolkit is based on a simple premise: simple concepts should be learned before advanced ...
A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among whi...
Davide Grossi, Frank Dignum, Virginia Dignum, Mehd...