Sciweavers

3265 search results - page 9 / 653
» Representing Groups on Graphs
Sort
View
PADS
2004
ACM
14 years 2 months ago
Exploiting Symmetry for Partitioning Models in Parallel Discrete Event Simulation
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
Jan Lemeire, Bart Smets, Philippe Cara, Erik F. Di...
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
14 years 2 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
SADM
2008
90views more  SADM 2008»
13 years 8 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
ICCS
2003
Springer
14 years 1 months ago
Representing Time and Modality in Narratives with Conceptual Graphs
In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a ...
Henrik Schärfe, Peter Øhrstrøm