376 search results - page 57 / 76 » Optimizing Pattern Matching Compilation by Program Transform... |
135
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
138
click to vote
LCTRTS
2010
Springer
15 years 8 months ago
2010
Springer
Continuous technology scaling has brought us to a point, where transistors have become extremely susceptible to cosmic radiation strikes, or soft errors. Inside the processor, cac...
128
click to vote
CGO
2010
IEEE
15 years 11 months ago
2010
IEEE
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
126
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
147
Voted
MPC
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...