Sciweavers

539 search results - page 2 / 108
» Recurrence relations and fast algorithms
Sort
View
IEEEPACT
2006
IEEE
13 years 11 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
MOC
2002
136views more  MOC 2002»
13 years 5 months ago
Automatic reduction of elliptic integrals using Carlson's relations
In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions, using a group of multivariate recurre...
Norman Gray
PAMI
2007
138views more  PAMI 2007»
13 years 4 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
CPHYSICS
2010
195views more  CPHYSICS 2010»
13 years 5 months ago
Fast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
Masayuki Toyoda, Taisuke Ozaki
IPL
2006
88views more  IPL 2006»
13 years 5 months ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba