1664 search results - page 49 / 333 » Distance labeling in graphs |
132
click to vote
TAL
2010
Springer
14 years 9 months ago
2010
Springer
This paper shows how the best data-driven dependency parsers available today [1] can be improved by learning from unlabeled data. We focus on German and Swedish and show that label...
GD
2001
Springer
15 years 4 months ago
2001
Springer
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
DM
2010
14 years 12 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
111
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...