740 search results - page 40 / 148 » An approximation ratio for biclustering |
118
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
CPM
2006
Springer
15 years 5 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
127
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
112
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
107
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...