3894 search results - page 41 / 779 » Approximation Algorithms for Biclustering Problems |
125
click to vote
ECML
2005
Springer
15 years 1 months ago
2005
Springer
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
126
click to vote
PODC
2009
ACM
16 years 11 days 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...
117
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
ESA
2007
Springer
15 years 6 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...