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 Duality Result Concerning Voronoi Diagrams.
A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
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-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
A note on comparison of Turing machines with computers
A note on complexity of algorithmic nets without cycles
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do not overlap, it is also a unit coin graph or penny graph. It is known that finding a maximum independent set in a unit disk graph is a NP-hard problem. In this work we extend this result to penny graphs. Furthermore, we prove that finding a minimum clique partition in a penny graph is also NP-hard, and present two linear-time approximation algorithms for the computation of clique partitions: a 3-approximation...
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do not overlap, it is also a unit coin graph or penny graph. It is known that finding a maximum independent set in a unit disk graph is a NP-hard problem. In this work we extend this result to penny graphs. Furthermore, we prove that finding a minimum clique partition in a penny graph is also NP-hard, and present two linear-time approximation algorithms for the computation of clique partitions: a 3-approximation...
A note on minimum-dummy-activities PERT networks
A note on NSPACE () and substitution
A note on the computational complexity of computing the edge rotation distance between graphs
A note on the computational complexity of hierarchical overlapping clustering
In this paper the computational complexity of the problem of the approximation of a given dissimilarity measure on a finite set by a -ultrametric on and by a Robinson dissimilarity measure on is investigared. It is shown that the underlying decision problems are NP-complete.
A partially persistent data structure for the set-union problem
A Polynomial Solution for the Potato-peeling Problem.
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
A probabilistic analysis of a new satisfiability algorithm
A Simple and Relatively Efficient Triangulation of the n-Cube.
A solvable case of the set-partitioning problem