557 search results - page 24 / 112 » Visualizing Weighted Edges in Graphs |
GD
2004
Springer
15 years 4 months ago
2004
Springer
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
77
Voted
EMNLP
2008
15 years 15 days ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
PRL
2006
14 years 11 months ago
2006
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is...