7015 search results - page 40 / 1403 » Approximation algorithms for co-clustering |
IPL
2008
13 years 9 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
IPL
2011
13 years 4 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...