This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Graph-based semi-supervised learning has gained considerable
interests in the past several years thanks to its effectiveness
in combining labeled and unlabeled data through
labe...
Abstract. This paper studies different specifications of belief propagation for stereo analysis of seven rectified stereo night-vision sequences (provided by Daimler AG). As sho...