Results 241 to 250 of about 323,805 (281)
Some of the next articles are maybe not open access.
Algorithms for Labeling Focus Regions
IEEE Transactions on Visualization and Computer Graphics, 2012In this paper, we investigate the problem of labeling point sites in focus regions of maps or diagrams. This problem occurs, for example, when the user of a mapping service wants to see the names of restaurants or other POIs in a crowded downtown area but keep the overview over a larger area.
Martin Fink 0001 +4 more
openaire +2 more sources
Relaxation labelling algorithms — a review
Image and Vision Computing, 1985Abstract An important research topic in image processing and image interpretation methodology is the development of methods to incorporate contextual information into the interpretation of objects. Over the last decade, relaxation labelling has been a useful and much studied approach to this problem. It is an attractive technique because it is highly
KITTLER, J, ILLINGWORTH, J
openaire +2 more sources
New Approximation Algorithms for Map Labeling with Sliding Labels
Journal of Combinatorial Optimization, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Binhai Zhu, Zhongping Qin
openaire +1 more source
EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
International Journal of Computational Geometry & Applications, 2001In this paper we propose and study two practical variations of the map labeling problem: Given a set S of n distinct (point) sites in the plane, label each site with: (1) a pair of non-intersecting squares of maximum possible size, (2) a pair of non-intersecting circles of maximum possible size (all the squares and circles are topologically open and ...
Binhai Zhu, Chung Keung Poon
openaire +1 more source
Joint label completion and label-specific features for multi-label learning algorithm
Soft Computing, 2020Label correlations have always been one of the hotspots of multi-label learning. Using label correlations to complete the original label can enrich the information of the label matrix. At the same time, label-specific features give a thought that different labels have inherent characteristics that can be distinguished, and we can use label correlations
Yibin Wang 0002 +3 more
openaire +1 more source
2013
Given a weighted graph, a distance oracle takes as an input a pair of vertices and returns the distance between them. The labeling approach to distance oracle design is to precompute a label for every vertex so that the distances can be computed from the corresponding labels, without looking at the graph.
openaire +1 more source
Given a weighted graph, a distance oracle takes as an input a pair of vertices and returns the distance between them. The labeling approach to distance oracle design is to precompute a label for every vertex so that the distances can be computed from the corresponding labels, without looking at the graph.
openaire +1 more source
Polynomial Time Algorithms for Three-Label Point Labeling
2001In this paper, we present an O(n3 log n) time solution for the following multi-label map labeling problem: Given a set S of n distinct sites in the plane, place at each site a triple of uniform squares of maximum possible size such that all the squares are axis-parallel and a site is on the boundaries of its three labeling squares.
Rob Duncan, Jianbo Qian, Binhai Zhu
openaire +1 more source
Efficient Approximation Algorithms for Multi-label Map Labeling
1999In this paper we study two practical variations of the map labeling problem: Given a set S of n distinct sites in the plane, one needs to place at each site: (1) a pair of uniform and non-intersecting squares of maximum possible size, (2) a pair of uniform and nonintersecting circles of maximum possible size. Almost nothing has been done before in this
Binhai Zhu, Chung Keung Poon
openaire +1 more source
A Modified Integer Labeling for Complementarity Algorithms
Mathematics of Operations Research, 1981Nonlinear complementary problems can be solved by algorithms based on the principle of simplicial approximation. We present such an algorithm that allows the choice of an arbitrary starting point without using an artificial labeling or an extra dimension.
openaire +2 more sources
Algorithmic Aspects of the S-Labeling Problem
2016Given a graph \(G = (V,E)\) of order n and maximum degree \(\varDelta \), the NP-complete S-labeling problem consists in finding a labeling of G, i.e. a bijective mapping \(\phi : V \rightarrow \{1, 2 \ldots n\}\), such that \(\mathrm{SL}_{\phi }(G)=\sum _{\{u,v\} \in E} \min \{\phi (u), \phi (v)\}\) is minimized.
Fertin, Guillaume +2 more
openaire +2 more sources