251 search results - page 4 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
ISAAC
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
JCO
2010
13 years 6 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
ICALP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
PAMI
2010
13 years 2 months ago
2010
Abstract--This paper presents local spline regression for semisupervised classification. The core idea in our approach is to introduce splines developed in Sobolev space to map the...