: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
We report on a query compilation technique that enables the construction of alternative efficient query providers for Microsoft’s Language Integrated Query (LINQ) framework. LIN...
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...