In this paper we propose an OWL encoded context ontology (CONON) for modeling context in pervasive computing environments, and for supporting logicbased context reasoning. CONON p...
Xiaohang Wang, Daqing Zhang, Tao Gu, Hung Keng Pun...
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
Our industrial advisory boards tell us that our students are well prepared technically, but they lack important group work skills. Simply adding project courses and requiring that...
William M. Waite, Michele H. Jackson, Amer Diwan, ...