Sciweavers

775 search results - page 6 / 155
» Map Labeling and Its Generalizations
Sort
View
COMGEO
1999
ACM
14 years 9 months ago
Point labeling with sliding labels
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
APVIS
2007
14 years 11 months ago
Labeling collinear sites
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...

Publication
130views
16 years 8 months ago
General Weighted Fairness and its Support in Explicit Rate Switch Algorithms
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...
75
Voted
MFCS
1998
Springer
15 years 1 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
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 ...
Bruno Courcelle, Denis Lapoire
85
Voted
ICML
2007
IEEE
15 years 10 months ago
What is decreased by the max-sum arc consistency algorithm?
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...
Tomás Werner