164 search results - page 14 / 33 » Equivalent Transformation by Safe Extension of Data Structur... |
109
Voted
PLDI
2003
ACM
15 years 5 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...
124
Voted
AGTIVE
2003
Springer
15 years 5 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
97
Voted
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
100
Voted
POPL
1995
ACM
15 years 4 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
118
click to vote
GG
2008
Springer
15 years 1 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...