3680 search results - page 498 / 736 » cases 2010 |
218
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
196
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
144
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, becaus...
166
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
154
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...