3894 search results - page 401 / 779 » Approximation Algorithms for Biclustering Problems |
163
click to vote
NIPS
2007
15 years 6 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
133
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
123
Voted
ISPD
1997
ACM
15 years 9 months ago
1997
ACM
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
152
click to vote
JCO
2008
15 years 4 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
149
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...