Sciweavers

1882 search results - page 102 / 377
» Transformational Programming and Forests
Sort
View
LANMR
2007
14 years 11 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...
FUIN
2006
85views more  FUIN 2006»
14 years 10 months ago
Higher Order Deforestation
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
Geoff W. Hamilton
AI
2011
Springer
14 years 4 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
FOCS
1998
IEEE
15 years 2 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin
ASAP
2005
IEEE
151views Hardware» more  ASAP 2005»
15 years 3 months ago
Performance Comparison of SIMD Implementations of the Discrete Wavelet Transform
This paper focuses on SIMD implementations of the 2D discrete wavelet transform (DWT). The transforms considered are Daubechies’ real-to-real method of four coefficients (Daub-...
Asadollah Shahbahrami, Ben H. H. Juurlink, Stamati...