Sciweavers

727 search results - page 75 / 146
» ads 2004
Sort
View
PERCOM
2004
ACM
14 years 9 months ago
Ontology Based Context Modeling and Reasoning using OWL
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...
DCC
2004
IEEE
14 years 9 months ago
Online Suffix Trees with Counts
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...
Breanndán Ó Nualláin, Steven ...
COCOON
2005
Springer
14 years 3 months ago
Bounded Degree Closest k-Tree Power Is NP-Complete
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 ...
Michael Dom, Jiong Guo, Rolf Niedermeier
APLAS
2004
ACM
14 years 3 months ago
Concurrency Combinators for Declarative Synchronization
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
Pawel T. Wojciechowski
SIGCSE
2004
ACM
114views Education» more  SIGCSE 2004»
14 years 3 months ago
Student culture vs group work in computer science
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, ...