We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
There is a strong demand for techniques to aid development and modelling of security critical systems. Based on general security evaluation criteria, we show how to extend the syst...
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this approach. This article outlines both the opportun...
With the growth of social bookmarking a new approach for metadata creation called tagging has emerged. In this paper we evaluate the use of tag presentation techniques. The main g...
Several techniques have been suggested for supporting reverse engineering and design recovery activities. While many of these techniques have been cataloged in various collections...