Most of the existing recommendation engines do not take into consideration contextual information for suggesting interesting items to users. Features such as time, location, or weather, may affect the user preferences for a particular item. In this paper, we propose two different context-aware approaches for the movie recommendation task. The first is an… (More)
We like to fix the starting point of the research activities in Symbolic and Algebraic Computation (SAC) in Italy at the IFIP Working Conference on Symbol Manipulation Languages and Techniques held in Pisa in September 1966. This event in fact, stimulated early research conducted for several years by single researchers cooperating more with foreign… (More)
This paper presents a new algorithmic approach to cope with the problems related to the generation and the manipulation of the pseudo-Hensel-codes in the p-adic arithmetic. After reviewing some classical properties and the results of the Hensel code arithmetic, a new algorithm to manipulate pseudo-Hensel-codes is presented, discussed and compared with two… (More)
The problem of rational arithmetic has been studied recently by many authors. For instance we can mention the work of Horn  and of Matula and Kornerup .
The problem of localizing real zeros of polynomials with parametric coefficients is considered.An informative solution to this problem is proposed and an algorithm based on a generalization of Sturm's method for univariate polynomials over the reals is presented. Thus, given a polynomial P(x,y), where x is the variable and y a parameter, and a real interval… (More)