705 search results - page 12 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
SAC
2005
ACM
15 years 3 months ago
2005
ACM
During language evolution, compiler construction is usually d along two dimensions: defining new abstract syntax tree (AST) classes, or adding new operations. In order to facilita...
POPL
1998
ACM
15 years 1 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
APLAS
2000
ACM
15 years 2 months ago
2000
ACM
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...
CF
2007
ACM
15 years 1 months ago
2007
ACM
Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this p...
58
Voted
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...