Local Binary Patterns (LBP) have been well exploited for facial image analysis recently. In the existing work, the LBP histograms are extracted from local facial regions, and used as a whole for the regional description. However, not all bins in the LBP histogram are necessary to be useful for facial representation. In this paper, we propose to learn discriminative LBP-Histogram (LBPH) bins for...

As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially bounded integers, then the problem can be solved in time n for an input of length n by dynamic programming. We show, by proving the W[1]-hardness of Unary Bin Packing (where the sizes are given in u...

We consider the Variable Size Bin Packing Problem with Fixed Costs, a generalization of the well-known bin packing problem where a set of items must be packed within a set of heterogeneous bins characterized by possibly different volumes and fixed costs. The objective of the problem is to select the bins to pack all items while minimizing the total cost incurred for the selected bins. We presen...

We study a higher-dimensional ‘balls-into-bins’ problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to keep the sums of the vectors in the different bins close together; how close can we keep these sums almost surely? This question, our primary focus in this pap...

This paper considers a multistage balls-and-bins problem with optimal stopping connected the job allocation model. There are N steps. The player drops balls (tasks) randomly one at time into available bins (servers). game begins only empty bin. At each step, new bin can appear probability p. step n (n = 1, . ,N), choose to stop and receive payoff or continue process move next step. If stops, th...

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build o...