We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
This paper reports on results concerning the combination of non-standard semantics via interpreters. We define what a semantics combination means and identify under which condition...
Building common ontologies, setting up measurement programs, and conducting interviews are valid techniques to start eliciting knowledge and experience for later reuse. However, th...