Results 11  20
of
1,157,670
Pedestrian Detection Using Wavelet Templates
 in Computer Vision and Pattern Recognition
, 1997
"... This paper presents a trainable object detection architecture that is applied to detecting people in static images of cluttered scenes. This problem poses several challenges. People are highly nonrigid objects with a high degree of variability in size, shape, color, and texture. Unlike previous app ..."
Abstract

Cited by 276 (23 self)
 Add to MetaCart
This paper presents a trainable object detection architecture that is applied to detecting people in static images of cluttered scenes. This problem poses several challenges. People are highly nonrigid objects with a high degree of variability in size, shape, color, and texture. Unlike previous
Quadrature formulae for Fourier coefficients
, 2009
"... We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the FourierTchebycheff coefficients given b ..."
Abstract
 Add to MetaCart
We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the FourierTchebycheff coefficients given
On the Computation of Fourier Coefficients
"... In this paper we derive an identity for the Fourier coefficients of a differentiable function f(t) in terms of the Fourier coefficients of its derivative f ′ (t). This yields an algorithm to compute the Fourier coefficients of f(t) whenever the Fourier coefficients of f ′ (t) are known, and vice ver ..."
Abstract
 Add to MetaCart
versa. Furthermore this generates an iterative scheme for N times differentiable functions complementing the direct computation of Fourier coefficients via the defining integrals which can be also treated automatically in certain cases, see [5] and [2]. 1
Learning Decision Trees using the Fourier Spectrum
, 1991
"... This work gives a polynomial time algorithm for learning decision trees with respect to the uniform distribution. (This algorithm uses membership queries.) The decision tree model that is considered is an extension of the traditional boolean decision tree model that allows linear operations in each ..."
Abstract

Cited by 204 (10 self)
 Add to MetaCart
demonstrate that any function f whose L 1 norm (i.e., the sum of absolute value of the Fourier coefficients) is polynomial can be approximated by a polynomially sparse function, and prove that boolean decision trees with linear operations are a subset of this class of functions. Moreover, it is shown
The FourierSeries Method For Inverting Transforms Of Probability Distributions
, 1991
"... This paper reviews the Fourierseries method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourierseries method are remar ..."
Abstract

Cited by 207 (52 self)
 Add to MetaCart
by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourierseries method is the Poisson summation formula, which identifies the discretization error
AN UPDATE ALGORITHM FOR FOURIER COEFFICIENTS
"... In this article we present a new technique to obtain the Discrete Fourier coefficients for a moving data window of an arbitrary length. Unlike the classic approaches we derive an update algorithm by exploiting results of update formulas for orthogonal polynomials. For the vector space of polynomial ..."
Abstract
 Add to MetaCart
In this article we present a new technique to obtain the Discrete Fourier coefficients for a moving data window of an arbitrary length. Unlike the classic approaches we derive an update algorithm by exploiting results of update formulas for orthogonal polynomials. For the vector space
Fourier Coefficients for G_2
, 1999
"... this paper, we develop a theory of Fourier coefficients c A (f) for certain modular forms f on the split group G 2 over Q. The coefficients are indexed by totally real cubic rings A: commutative rings with unit that are free of rank 3 over Z, such that the Ralgebra ..."
Abstract
 Add to MetaCart
this paper, we develop a theory of Fourier coefficients c A (f) for certain modular forms f on the split group G 2 over Q. The coefficients are indexed by totally real cubic rings A: commutative rings with unit that are free of rank 3 over Z, such that the Ralgebra
ON THE FOURIER COEFFICIENTS OF MODULAR FORMS OF
"... Abstract: We prove a formula relating the Fourier coefficients of a modular form of halfintegral weight to the special values of Lfunctions. The form in question is an explicit theta lift from the multiplicative group of an indefinite quaternion algebra over Q. This formula has applications to pro ..."
Abstract
 Add to MetaCart
Abstract: We prove a formula relating the Fourier coefficients of a modular form of halfintegral weight to the special values of Lfunctions. The form in question is an explicit theta lift from the multiplicative group of an indefinite quaternion algebra over Q. This formula has applications
Results 11  20
of
1,157,670