Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
This paper proposes a novel method for matching road vehicles between two non-overlapping cameras. The matching problem is formulated as a same-different classification problem: p...
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Though skyline queries already have claimed their place in retrieval over central databases, their application in Web information systems up to now was impossible due to the distri...
Abstract. One of the most difficult obstacles Web Services have to overcome in the attempt to exploit the true potential of the World Wide Web is heterogeneity. Caused by the natur...