15033 search results - page 409 / 3007 » Complexity Theory and Algorithms |
197
click to vote
ISSAC
2009
Springer
16 years 2 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
173
click to vote
AIPS
2000
15 years 9 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
196
click to vote
JOC
2006
15 years 7 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 ...
240
click to vote
IPSN
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
186
Voted
ISCAS
2007
IEEE
16 years 1 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...