746 search results - page 65 / 150 » Fast (Structured) Newton Computations |
ICDE
2001
IEEE
14 years 11 months ago
2001
IEEE
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
DAGSTUHL
2003
13 years 11 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
SIGMETRICS
2000
ACM
14 years 2 months ago
2000
ACM
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
HIPEAC
2010
Springer
14 years 4 days ago
2010
Springer
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...