727 search results - page 75 / 146 » ads 2004 |
119
click to vote
PERCOM
2004
ACM
16 years 10 days ago
2004
ACM
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...
93
Voted
DCC
2004
IEEE
16 years 9 days ago
2004
IEEE
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...
86
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
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 ...
115
click to vote
APLAS
2004
ACM
15 years 6 months ago
2004
ACM
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
108
click to vote
SIGCSE
2004
ACM
15 years 6 months ago
2004
ACM
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...