3894 search results - page 638 / 779 » Approximation Algorithms for Biclustering Problems |
184
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
147
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
136
click to vote
CIAC
2000
Springer
15 years 7 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
144
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
108
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...