It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Abstract: One of the difficulties that self-directed learners face on their learning process is choosing the right learning resources. One of the goals of adaptive educational syst...
Provenance in scientific workflows is a double-edged sword. On the one hand, recording information about the module executions used to produce a data item, as well as the parame...
Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Ju...
In this paper we review the history of systems for managing “Big Data” as well as today’s activities and architectures from the (perhaps biased) perspective of three “data...
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...