6365 search results - page 48 / 1273 » Fast Local Computation Algorithms |
103
Voted
DAGM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we present a novel approach for expanding spherical 3D-tensor fields of arbitrary order in terms of a tensor valued local Fourier basis. For an efficient implementati...
83
Voted
ARITH
1997
IEEE
15 years 4 months ago
1997
IEEE
81
Voted
MOC
1998
15 years 6 days ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
108
click to vote
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
107
Voted
WABI
2001
Springer
15 years 5 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...