Sciweavers

3265 search results - page 108 / 653
» Representing Groups on Graphs
Sort
View
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
15 years 8 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
15 years 4 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
JCP
2008
171views more  JCP 2008»
15 years 3 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
NN
2006
Springer
104views Neural Networks» more  NN 2006»
15 years 3 months ago
Local multidimensional scaling
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
Jarkko Venna, Samuel Kaski
AMW
2011
14 years 7 months ago
SNQL: A Social Networks Query and Transformation Language
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...
Mauro San Martín, Claudio Gutierrez, Peter ...