In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
—This paper argues that algorithmic skeletons are a suitable programming model for multi-core architectures. -level abstractions offered by algorithmic skeletons provide a simple...
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred ...