1550 search results - page 82 / 310 » Benchmarking for Graph Transformation |
122
click to vote
PKDD
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
168
click to vote
IOR
2011
14 years 10 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
126
click to vote
KBSE
1995
IEEE
15 years 6 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
123
click to vote
SPATIALCOGNITION
2000
Springer
15 years 6 months ago
2000
Springer
We present an approach to spatial inference which is based on the procedural semantics of spatial relations. In contrast to qualitative reasoning, we do not use discrete symbolic m...
123
click to vote
SEMWEB
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...