790 search results - page 62 / 158 » Subexponential Parameterized Algorithms |
144
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
121
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
104
click to vote
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Data clustering is a highly used knowledge extraction technique and is applied in more and more application domains. Over the last years, a lot of algorithms have been pr...
115
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
175
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...