575 search results - page 5 / 115 » Computing Maximum Subsequence in Parallel |
PPAM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received...