436 search results - page 17 / 88 » Recursion and Complexity |
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
POPL
2000
ACM
15 years 4 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
101
click to vote
IJCAI
2003
15 years 1 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
TSP
2010
14 years 6 months ago
2010
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
ISCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— This paper considers designing in the minimax sense complementary low-pass/high-pass approximately linear-phase recursive filters with variable magnitude characteristi...