Sciweavers

71228 search results - page 92 / 14246
» Algorithms
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
14 years 1 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
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...
ICML
2007
IEEE
16 years 2 months ago
Quantum clustering algorithms
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, ...
Esma Aïmeur, Gilles Brassard, Sébastie...
ICML
2007
IEEE
16 years 2 months ago
CarpeDiem: an algorithm for the fast evaluation of SSL classifiers
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...
Roberto Esposito, Daniele P. Radicioni
PDP
2010
IEEE
15 years 8 months ago
Skandium: Multi-core Programming with Algorithmic Skeletons
—This paper argues that algorithmic skeletons are a suitable programming model for multi-core architectures. -level abstractions offered by algorithmic skeletons provide a simple...
Mario Leyton, José M. Piquer
ICC
2009
IEEE
136views Communications» more  ICC 2009»
15 years 8 months ago
Approximation Algorithm for QoS Routing with Multiple Additive Constraints
—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 ...