436 search results - page 27 / 88 » Recursion and Complexity |
TIT
1998
13 years 7 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
AMC
2008
13 years 8 months ago
2008
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While m...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
FUIN
2006
13 years 7 months ago
2006
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...