441 search results - page 14 / 89 » Refinement of Time |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
75
Voted
DAC
1998
ACM
15 years 10 months ago
1998
ACM
Successive, formal refinement is a new approach for specification of embedded systems using a general-purpose programming language. Systems are formally modeled as Abstractable Sy...
GD
1998
Springer
15 years 1 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
81
Voted
JGAA
2000
14 years 9 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
80
Voted
AMAST
2004
Springer
15 years 1 months ago
2004
Springer
Since Z, being a state-based language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also...