740 search results - page 19 / 148 » An approximation ratio for biclustering |
104
Voted
AAAI
2008
15 years 4 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
117
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
118
Voted
TCS
2010
15 years 8 days ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
JCB
2007
15 years 1 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
160
click to vote
JMLR
2012
13 years 4 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...