Sciweavers

852 search results - page 78 / 171
» Using graph parsing for automatic graph drawing
Sort
View
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
ACL
2008
14 years 11 months ago
Semantic Class Learning from the Web with Hyponym Pattern Linkage Graphs
We present a novel approach to weakly supervised semantic class learning from the web, using a single powerful hyponym pattern combined with graph structures, which capture two pr...
Zornitsa Kozareva, Ellen Riloff, Eduard H. Hovy
VLC
2002
99views more  VLC 2002»
14 years 9 months ago
Flexible Graph Layout for the Web
More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most import...
Trevor Hansen, Kim Marriott, Bernd Meyer, Peter J....
GD
2007
Springer
15 years 4 months ago
A Bipartite Strengthening of the Crossing Lemma
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
Jacob Fox, János Pach, Csaba D. Tóth
IESS
2007
Springer
162views Hardware» more  IESS 2007»
15 years 4 months ago
Automatic Parallelization of Sequential Specifications for Symmetric MPSoCs
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...
Fabrizio Ferrandi, Luca Fossati, Marco Lattuada, G...