Displaying 81 – 100 of 332

Showing per page

A new curve fitting based rating prediction algorithm for recommender systems

Yilmaz Ar, Şahin Emrah Amrahov, Nizami A. Gasilov, Sevgi Yigit-Sert (2022)

Kybernetika

The most algorithms for Recommender Systems (RSs) are based on a Collaborative Filtering (CF) approach, in particular on the Probabilistic Matrix Factorization (PMF) method. It is known that the PMF method is quite successful for the rating prediction. In this study, we consider the problem of rating prediction in RSs. We propose a new algorithm which is also in the CF framework; however, it is completely different from the PMF-based algorithms. There are studies in the literature that can increase...

A new practical linear space algorithm for the longest common subsequence problem

Heiko Goeman, Michael Clausen (2002)

Kybernetika

This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths m and n , n m , on an alphabet of size s , we first present an algorithm which determines the length p of an LCS in O ( n s + min { m p , p ( n - p ) } ) time and O ( n s ) space. This result has been achieved before [ric94,ric95], but our algorithm is significantly faster than previous methods. We also provide a second algorithm which generates an LCS in O ( n s + min { m p , m log m + p ( n - p ) } ) time while preserving the linear space bound, thus solving...

A non-uniform finitary relational semantics of system T

Lionel Vaux (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study iteration and recursion operators in the denotational semantics of typed λ-calculi derived from the multiset relational model of linear logic. Although these operators are defined as fixpoints of typed functionals, we prove them finitary in the sense of Ehrhard’s finiteness spaces.

A note on Coinduction and Weak Bisimilarity for While Programs

J. J.M.M. Rutten (2010)

RAIRO - Theoretical Informatics and Applications

An illustration of coinduction in terms of a notion of weak bisimilarity is presented. First, an operational semantics 𝒪 for while programs is defined in terms of a final automaton. It identifies any two programs that are weakly bisimilar, and induces in a canonical manner a compositional model 𝒟 . Next 𝒪 = 𝒟 is proved by coinduction.

Currently displaying 81 – 100 of 332