266 search results - page 13 / 54 » New algorithms for computing directional discrete Fourier tr... |
JISE
2006
13 years 7 months ago
2006
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
CANS
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
SIP
2001
13 years 9 months ago
2001
The paper presents basic concepts of the discrete system theory from the viewpoint of Banach algebras and shows that some Banach algebras of sequences are not only suitable mathem...
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
In this report, we propose a new definition of the E2 DT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...