Sciweavers

1664 search results - page 44 / 333
» Distance labeling in graphs
Sort
View
NAACL
2007
15 years 1 months ago
Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
Andrei Alexandrescu, Katrin Kirchhoff
COR
2008
92views more  COR 2008»
14 years 12 months ago
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
ECUMN
2007
Springer
15 years 6 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
15 years 6 months ago
Measuring the Similarity of Geometric Graphs
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
ICC
2000
IEEE
127views Communications» more  ICC 2000»
15 years 3 months ago
Edge Profile Optimal Constellation Labeling
Structurally distinct constellation labelings exist within both the Gray code and the set-partitioning paradigm. Different labeling choices within either paradigm can provide diffe...
Richard D. Wesel, Xueting Liu