The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
This paper proposes a general modeling framework adapted to the feedback control of traffic flows in Eulerian models of the National Airspace System (NAS). It is shown that the pro...
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
Souheib Baarir, Marco Beccuti, Claude Dutheillet, ...
In social bookmarking systems, existing methods in tag prediction have shown that the performance of prediction can be significantly improved by modeling users’ preferences. Ho...