We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. While the ...
— It has for long been recognized that in multi-cell wide-band code division multiple access (WCDMA) networks the admission of a new session into the system can have undesirable ...
Abstract. This paper analyzes the results of automatic concept alignment between two ontologies. We use an iterative algorithm to perform concept alignment. The algorithm uses the ...
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...