As the amount of online shoppers grows rapidly, the need of recommender systems for e-commerce sites are demanding, especially when the number of users and products being offered o...
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
This paper investigates the application of the delayed normalized least mean square (DNLMS) algorithm to echo cancellation. In order to reduce the amount of computations, DNLMS is ...
Raymond Lee, Esam Abdel-Raheem, Mohammed A. S. Kha...
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
In this paper we present a new theory and an algorithm for image segmentation based on a strength of connectedness between every pair of image elements. The object definition use...
Krzysztof Ciesielski, Jayaram K. Udupa, Punam K. S...
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...