Results 1  10
of
954,895
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 982 (11 self)
 Add to MetaCart
to be factored, n = deg(f) is the degree of f, and for a polynomial ~ a ~ i with real coefficients a i. i An outline of the algorithm is as follows. First we find, for a suitable small prime number p, a padic irreducible factor h of f, to a certain precision. This is done with Berlekamp's algorithm
On nonvanishing univalent functions with real coefficients
, 1986
"... Using the wellknown Brickman representation for univalent functions, it is shown that the extreme points of the set So(R) of nonvanishing univalent functions with real coefficients omit only real values. Furthermore a support point of So(R) is shown to have the same property. 1. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Using the wellknown Brickman representation for univalent functions, it is shown that the extreme points of the set So(R) of nonvanishing univalent functions with real coefficients omit only real values. Furthermore a support point of So(R) is shown to have the same property. 1.
RealTime Tracking of NonRigid Objects using Mean Shift
 IEEE CVPR 2000
, 2000
"... A new method for realtime tracking of nonrigid objects seen from a moving camera isproposed. The central computational module is based on the mean shift iterations and nds the most probable target position in the current frame. The dissimilarity between the target model (its color distribution) an ..."
Abstract

Cited by 809 (20 self)
 Add to MetaCart
) and the target candidates is expressed by a metric derived from the Bhattacharyya coefficient. The theoretical analysis of the approach shows that it relates to the Bayesian framework while providing a practical, fast and efficient solution. The capability of the tracker to handle in realtime partial occlusions
Orthogonal Rational Functions with real coefficients and semiseparable matrices
"... When one wants to use Orthogonal Rational Functions (ORFs) in system identification or control theory, it is important to be able to avoid complex calculations. In this paper we study ORFs whose numerator and denominator polynomial have real coefficients. These ORFs with real coefficients (RORFs) ..."
Abstract
 Add to MetaCart
When one wants to use Orthogonal Rational Functions (ORFs) in system identification or control theory, it is important to be able to avoid complex calculations. In this paper we study ORFs whose numerator and denominator polynomial have real coefficients. These ORFs with real coefficients (RORFs
Zerosets of Clifford Analytic Functions with Real Coefficients
"... Abstract: In this note we prove that the zero set of any Clifford analytic function f with real coefficients is the disjoint union of real isolated zeroes and the spherical conjugate ones. What is more, we present a technique for computing the zeroes. We also find the preimages f−1(A) for any parave ..."
Abstract
 Add to MetaCart
Abstract: In this note we prove that the zero set of any Clifford analytic function f with real coefficients is the disjoint union of real isolated zeroes and the spherical conjugate ones. What is more, we present a technique for computing the zeroes. We also find the preimages f−1(A) for any
Image denoising using a scale mixture of Gaussians in the wavelet domain
 IEEE TRANS IMAGE PROCESSING
, 2003
"... We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vecto ..."
Abstract

Cited by 514 (17 self)
 Add to MetaCart
We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian
Precomputed Radiance Transfer for RealTime Rendering in Dynamic, LowFrequency Lighting Environments
 ACM Transactions on Graphics
, 2002
"... We present a new, realtime method for rendering diffuse and glossy objects in lowfrequency lighting environments that captures soft shadows, interreflections, and caustics. As a preprocess, a novel global transport simulator creates functions over the object's surface representing transfer of ..."
Abstract

Cited by 472 (28 self)
 Add to MetaCart
We present a new, realtime method for rendering diffuse and glossy objects in lowfrequency lighting environments that captures soft shadows, interreflections, and caustics. As a preprocess, a novel global transport simulator creates functions over the object's surface representing transfer
On PowerLaw Relationships of the Internet Topology
 IN SIGCOMM
, 1999
"... Despite the apparent randomness of the Internet, we discover some surprisingly simple powerlaws of the Internet topology. These powerlaws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our powerl ..."
Abstract

Cited by 1666 (71 self)
 Add to MetaCart
laws fit the real data very well resulting in correlation coefficients of 96% or higher. Our observations provide a novel perspective of the structure of the Internet. The powerlaws describe concisely skewed distributions of graph properties such as the node outdegree. In addition, these powerlaws can
Comparison of parametric representations for monosyllabic word recognition in continuously spoken sentences
 ACOUSTICS, SPEECH AND SIGNAL PROCESSING, IEEE TRANSACTIONS ON
, 1980
"... Several parametric representations of the acoustic signal were compared as to word recognition performance in a syllableoriented continuous speech recognition system. The vocabulary included many phonetically similar monosyllabic words, therefore the emphasis was on ability to retain phonetically ..."
Abstract

Cited by 1089 (2 self)
 Add to MetaCart
phonetically significant acoustic information in the face of syntactic and duration variations. For each ~ arameter set (based on a melfrequency cepstrum, a linear frequency cepstrum, a linear prediction cepstrum, a linear prediction spectrum, or a set of reflection coefficients), word templates were
Results 1  10
of
954,895