This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
Wendyam Serge Boris Ouedraogo, Antoine Souloumiac,...