In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
This paper focuses on fuzzy image denoising techniques. In particular, we investigate the usage of fuzzy set theory in the domain of image enhancement using wavelet thresholding. W...
Stefan Schulte, Bruno Huysmans, Aleksandra Pizuric...
Conversion between different adaptive hypermedia systems has barely been proposed, yet alone tested in realistic settings. This paper presents the evaluation of the interoperabili...
Alexandra I. Cristea, Helen Ashman, Craig D. Stewa...
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...