A new algorithm for recognizing the unknot.
A new algorithm for the four counterfeit coins problem.
A New Approach to the Dynamic Maintenance of Maximal Points in a Plane.
A new class of balanced search trees : half-balanced binary search tress
A new curve fitting based rating prediction algorithm for recommender systems
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 decidable Horn fragment of predicate calculus.
A New Duality Result Concerning Voronoi Diagrams.
A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
A new modeling and solution approach for the number partitioning problem.
A new practical linear space algorithm for the longest common subsequence problem
This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths and , , on an alphabet of size , we first present an algorithm which determines the length of an LCS in time and 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 time while preserving the linear space bound, thus solving...
A non-deteministic time hierarchy over the reals.
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
A Non-Recursive Algorithm for Polygon Triangulation
A non-uniform finitary relational semantics of system T
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 normal form for restricted exponential functions
A note on coinduction and weak bisimilarity for while programs
A note on Coinduction and Weak Bisimilarity for While Programs
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.
A note on comparison of Turing machines with computers
A note on complexity of algorithmic nets without cycles
A note on connections between 0L-languages and context-free languages