Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
the following cost functions: In this paper, learning rules are proposed for simultaneous corn- GI(U) = tr{(UTU)(UTBU)-lD, (la) putation of minor eigenvectors of a covariance matri...
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
—In this paper, we study a new family of carrier-hopping prime codes (CHPCs), so-called quadraticcongruence CHPC (QC-CHPC), with expanded code cardinality by relaxing the maximum...
Wing C. Kwong, Cheng-Yuan Chang, Hung-Ta Chen, Guu...