This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
Michael A. Bekos, Michael Kaufmann, Antonios Symvo...
This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 spe...
Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goya...
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...