Sciweavers

712 search results - page 85 / 143
» On Spectral Graph Drawing
Sort
View
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 10 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
GD
2004
Springer
14 years 2 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
INFOVIS
1997
IEEE
14 years 1 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner
VL
2009
IEEE
187views Visual Languages» more  VL 2009»
14 years 3 months ago
Changing euler diagram properties by edge transformation of euler dual graphs
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
John Howse, Peter Rodgers, Gem Stapleton
IV
2009
IEEE
191views Visualization» more  IV 2009»
14 years 3 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber