2693 search results - page 94 / 539 » On Computing Complex Navigation Functions |
CANS
2010
Springer
13 years 8 months ago
2010
Springer
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper addresses the computational complexity of scalable video decoding using emerging scalable extension of H.264/AVC (SVC) standard compliant decoder. Scalable functionalit...
CC
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
IJCV
2000
13 years 9 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...