We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
Min Zhang, Wanxiang Che, Guodong Zhou, AiTi Aw, Ch...
Background: The chemical property and biological function of a protein is a direct consequence of its primary structure. Several algorithms have been developed which determine ali...
Kshitiz Gupta, Dina Thomas, S. V. Vidya, K. V. Ven...
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...