1327 search results - page 68 / 266 » Path following algorithm for the graph matching problem |
127
Voted
JMLR
2010
14 years 10 months ago
2010
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
172
Voted
SODA
2010
ACM
16 years 27 days ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
167
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
162
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
157
click to vote
DC
2010
15 years 3 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...