29 search results - page 1 / 6 » Approximation of Multi-color Discrepancy |
RANDOM
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
FOCS
1996
IEEE
13 years 9 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
AUSAI
2010
Springer
13 years 2 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
COMPUTING
2002
13 years 5 months ago
2002
It has been observed by E. Eberlein and U. Keller that the hyperbolic distribution fits logarithmic rates of returns of a stock much better than the normal distribution. We give a...
CORR
2010
Springer
13 years 5 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...