In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Abstract. A crucial issue in the management of sensor networks is the continuous monitoring of residual energy level of the sensors in the network. In this paper, we propose a hier...
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
A novel strategy for the representation and manipulation of distributed documents, potentially complex and heterogeneous, is presented in this paper. The document under the propos...