Results 1  10
of
8,352
Filter Design with Low Complexity Coefficients
"... We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of the filter coefficients, while still meeting a set of design specifications, such as limits on frequ ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of the filter coefficients, while still meeting a set of design specifications, such as limits
The particel swarm: Explosion, stability, and convergence in a multidimensional complex space
 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTION
"... The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately explained ..."
Abstract

Cited by 852 (10 self)
 Add to MetaCart
The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately
A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract

Cited by 424 (13 self)
 Add to MetaCart
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 523 (3 self)
 Add to MetaCart
on such a manifold and Taylor coefficients of periods of Hodge structures considered as functions on the moduli space of complex structures on a mirror manifold. Recently it has been realized that one can make predictions for numbers of curves of positive genera and also on CalabiYau manifolds of arbitrary
A Complex Coefficient Rational Approximation of ...
"... Rational approximations of p 1 + x are useful for oneway wave propagation modeling, where a square root operator must be approximated. The standard Pad'e approximants incorrectly propagate the evanescent modes corresponding to x ! \Gamma1. A modification of the Pad'e approximation is i ..."
Abstract
 Add to MetaCart
Rational approximations of p 1 + x are useful for oneway wave propagation modeling, where a square root operator must be approximated. The standard Pad'e approximants incorrectly propagate the evanescent modes corresponding to x ! \Gamma1. A modification of the Pad'e approximation is introduced in this paper. Our new approximants have positive real imaginary parts for x ! \Gamma1, which give the evanescent modes the desired damping. Mathematical properties of the new approximation are proved in this paper. An efficient numerical method for computing the prime fraction expansion of the new rational approximation is developed. 1 Introduction In this paper, we study a modification of the diagonal Pad'e approximation to the square root function. It is known that the [n=n] diagonal Pad'e approximant of g(x) = p 1 + x can be written as [22, 3] g n (x) = 1 + n X j=1 a (n) j x 1 + b (n) j x = n Y j=1 1 + c (n) j x 1 + b (n) j x (1) where b (n) j = cos 2 ` j ...
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
High confidence visual recognition of persons by a test of statistical independence
 IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample
Twisted equivariant Ktheory with complex coefficients
, 2008
"... Using a global version of the equivariant Chern character, we describe an effective method for computing the complexified twisted equivariant Ktheory of a space ..."
Abstract

Cited by 67 (5 self)
 Add to MetaCart
Using a global version of the equivariant Chern character, we describe an effective method for computing the complexified twisted equivariant Ktheory of a space
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth
Results 1  10
of
8,352