3670 search results - page 62 / 734 » Linear Recursive Functions |
121
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
101
Voted
SCP
1998
15 years 2 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
116
click to vote
IPL
2000
15 years 2 months ago
2000
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
123
click to vote
COCO
2009
Springer
15 years 9 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
Pseudorandom test techniques are widely used for measuring the impulse response (IR) for linear devices and Volterra kernels for nonlinear devices, especially in the acoustics dom...