1550 search results - page 116 / 310 » Benchmarking for Graph Transformation |
117
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...
128
click to vote
SCAM
2006
IEEE
15 years 9 months ago
2006
IEEE
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
135
Voted
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
120
click to vote
CC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
118
click to vote
ENTCS
2007
15 years 3 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...