Sciweavers

2766 search results - page 5 / 554
» Algorithms for trigonometric polynomials
Sort
View
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 8 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
ASAP
2005
IEEE
118views Hardware» more  ASAP 2005»
14 years 2 months ago
Real-time H/W Implementation of the Approximate Discrete Radon Transform
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real-time impl...
Michael T. Frederick, Nathan A. VanderHorn, Arun K...
CAGD
2008
80views more  CAGD 2008»
13 years 8 months ago
Division algorithms for Bernstein polynomials
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for c...
Laurent Busé, Ron Goldman
IJON
2007
184views more  IJON 2007»
13 years 8 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
STOC
1995
ACM
135views Algorithms» more  STOC 1995»
13 years 12 months ago
Subquadratic-time factoring of polynomials over finite fields
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
Erich Kaltofen, Victor Shoup