Results 1  10
of
776,989
THE SMITH NORMAL FORM OF A SPECIALIZED JACOBITRUDI MATRIX
"... Abstract. Let JTλ be the JacobiTrudi matrix corresponding to the partition λ, so det JTλ is the Schur function sλ in the variables x1, x2,.... Set x1 = · · · = xn = 1 and all other xi = 0. Then the entries of JTλ become polynomials in n of the form n+j−1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Let JTλ be the JacobiTrudi matrix corresponding to the partition λ, so det JTλ is the Schur function sλ in the variables x1, x2,.... Set x1 = · · · = xn = 1 and all other xi = 0. Then the entries of JTλ become polynomials in n of the form n+j−1
On Immanants of JacobiTrudi . . .
, 1993
"... Let Z be a character of the symmetric group 5P~. The immanant of an n x n matrix A = [a•] with respect to X is Zw~snZ(w)al,,~(t)...an, w~,). Goulden and Jackson conjectured, and Greene recently proved, that immanants of JacobiTrudi matrices are polynomials with nonnegative integer coefficients. Th ..."
Abstract
 Add to MetaCart
Let Z be a character of the symmetric group 5P~. The immanant of an n x n matrix A = [a•] with respect to X is Zw~snZ(w)al,,~(t)...an, w~,). Goulden and Jackson conjectured, and Greene recently proved, that immanants of JacobiTrudi matrices are polynomials with nonnegative integer coefficients
Learning the Kernel Matrix with SemiDefinite Programming
, 2002
"... Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information ..."
Abstract

Cited by 780 (22 self)
 Add to MetaCart
is contained in the socalled kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input spaceclassical model selection
Closedform solution of absolute orientation using unit quaternions
 J. Opt. Soc. Am. A
, 1987
"... Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the leastsquares pr ..."
Abstract

Cited by 973 (4 self)
 Add to MetaCart
Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the least
Understanding Normal and Impaired Word Reading: Computational Principles in QuasiRegular Domains
 PSYCHOLOGICAL REVIEW
, 1996
"... We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract

Cited by 583 (94 self)
 Add to MetaCart
and phonological representations that capture better the relevant structure among the written and spoken forms of words. In a number of simulation experiments, networks using the new representations learn to read both regular and exception words, including lowfrequency exception words, and yet are still able
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 659 (7 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
JACOBI–TRUDY FORMULA FOR GENERALISED SCHUR POLYNOMIALS
, 905
"... Abstract. Jacobi–Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials. 1. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Jacobi–Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials. 1.
The Nature and Growth of Vertical Specialization in World Trade
 Journal of International Economics
"... Abstract: Dramatic changes are occurring in the nature of international trade. Production processes increasingly involve a sequential, vertical trading chain stretching across many countries, with each country specializing in particular stages of a good’s production sequence. We document a key aspe ..."
Abstract

Cited by 470 (20 self)
 Add to MetaCart
Abstract: Dramatic changes are occurring in the nature of international trade. Production processes increasingly involve a sequential, vertical trading chain stretching across many countries, with each country specializing in particular stages of a good’s production sequence. We document a key
Results 1  10
of
776,989