Sciweavers

3396 search results - page 124 / 680
» Tree representations of graphs
Sort
View
ESANN
2006
13 years 10 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
DIAGRAMS
2008
Springer
13 years 10 months ago
Visualizing Non-subordination and Multidominance in Tree Diagrams: Testing Five Syntax Tree Variants
In linguistics, it is quite common to use tree diagrams for immediate constituent analysis of sentences. Traditionally, these trees are binary and twodimensional. However, phenomen...
Leonie Bosveld-de Smet, Mark de Vries
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 9 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
GD
2005
Springer
14 years 2 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
COCOON
2009
Springer
14 years 3 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern