3894 search results - page 399 / 779 » Approximation Algorithms for Biclustering Problems |
156
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
159
Voted
RANDOM
1998
Springer
15 years 9 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
116
click to vote
ICCD
2003
IEEE
16 years 1 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
158
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
146
click to vote
ALGORITHMICA
2010
15 years 5 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...