Sciweavers

463 search results - page 48 / 93
» The lattice dimension of a graph
Sort
View
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
15 years 4 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 4 months ago
Temporal Analysis of Semantic Graphs Using ASALSAN
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
Brett W. Bader, Richard A. Harshman, Tamara G. Kol...
PR
2007
81views more  PR 2007»
14 years 9 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
IV
2002
IEEE
121views Visualization» more  IV 2002»
15 years 2 months ago
Visualising a Fund Manager Flow Graph with Columns and Worms
This paper describes a paradigm for visualising time deflow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We ...
Tim Dwyer, Peter Eades
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 3 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan