We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
As the number of medical web sites in various languages increases, it is increasingly necessary to establish specific criteria and control measures that give consumers some guaran...
Miquel Angel Mayer, Vangelis Karkaletsis, Phil Arc...
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
This paper proposes a new multi-scale energy minimization algorithm which can be used to efficiently solve large scale labelling problems in computer vision. The basic modus operan...
Pushmeet Kohli, Victor S. Lempitsky, Carsten Rothe...
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectan...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
The Map Labelling Problem appears in several applications, mainly in Cartography. Although much research on this problem has been done, it is interesting to note that map-labellin...