10988 search results - page 189 / 2198 » Algorithmic Folding Complexity |
131
Voted
JOC
2006
15 years 3 months ago
2006
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
123
Voted
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
134
Voted
IFIPTCS
2000
15 years 7 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
98
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
114
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature ...