We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Fragile watermarking techniques for digital content have been studied in the past few years. Fragile watermarks are used to determine if a piece of watermarked digital content has...
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
Research on cross-language information retrieval (CLIR) has typically been restricted to settings using binary relevance assessments. In this paper, we present evaluation results f...
Raija Lehtokangas, Heikki Keskustalo, Kalervo J&au...