We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
We have developed a method for recognizing and tracking known three-dimensional objects in scene images captured from a user’s viewpoint. The method uses multiple color histogra...