We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
The development of correct OO distributed software is a daunting task as soon as the distributed interactions are not trivial. This is due to the inherent complexity of distribute...
We present an efficient method within an active vision framework for recognizing objects which are ambiguous from certain viewpoints. The system is allowed to reposition the camer...
Hermann Borotschnig, Lucas Paletta, Manfred Prantl...