Results 1  10
of
3,978
MAINTAINING 3CONNECTIVITY RELATIVE TO A FIXED BASIS
, 2007
"... A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting rows and columns of A correspond to contracting elements of B and deleting elements of E(M) −B. If M is 3connected, it is often desirable to perform such an element removal from M while maintaining ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A standard matrix representation A of a matroid M represents M relative to a fixed basis B. Deleting rows and columns of A correspond to contracting elements of B and deleting elements of E(M) −B. If M is 3connected, it is often desirable to perform such an element removal from M while
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
measurements do we need to recover objects from this class to within accuracy ɛ? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal f ∈ F decay like a powerlaw (or if the coefficient sequence of f in a fixed basis decays like a power
A SPLITTER THEOREM RELATIVE TO A FIXED BASIS
, 2012
"... A standard matrix representation of a matroid M represents M relative to a fixed basis B, where contracting elements of B and deleting elements of E(M)−B correspond to removing rows and columns of the matrix, while retaining standard form. If M is 3connected and N is a 3connected minor of M, it ..."
Abstract
 Add to MetaCart
A standard matrix representation of a matroid M represents M relative to a fixed basis B, where contracting elements of B and deleting elements of E(M)−B correspond to removing rows and columns of the matrix, while retaining standard form. If M is 3connected and N is a 3connected minor of M
A yieldfactor model of interest rates
 Math. Finance
, 1996
"... This paper presents a consistent and arbitragefree multifactor model of the term structure of interest rates in which yields at selected fixed maturities follow a parametric multivariate Markov diffusion process with “stochastic volatility. ” The yield of any zerocoupon bond is taken to be a matur ..."
Abstract

Cited by 665 (23 self)
 Add to MetaCart
This paper presents a consistent and arbitragefree multifactor model of the term structure of interest rates in which yields at selected fixed maturities follow a parametric multivariate Markov diffusion process with “stochastic volatility. ” The yield of any zerocoupon bond is taken to be a
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
, 1989
"... The exact form of a gradientfollowing learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a precis ..."
Abstract

Cited by 534 (4 self)
 Add to MetaCart
The exact form of a gradientfollowing learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a
From Few to many: Illumination cone models for face recognition under variable lighting and pose
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a generative appearancebased method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a smal ..."
Abstract

Cited by 754 (12 self)
 Add to MetaCart
We present a generative appearancebased method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a
Fixing the Java memory model
 In ACM Java Grande Conference
, 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract

Cited by 385 (10 self)
 Add to MetaCart
. For example, the commonly accepted definition for control dependence is incorrect for Java, and transformations based on it may be invalid. In addition to providing the official memory model for Java, we believe the model described here could prove to be a useful basis for other programming languages
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 506 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
A RankCorrected Procedure for Matrix Completion with Fixed Basis Coefficients
, 2012
"... In this paper, we address lowrank matrix completion problems with fixed basis coefficients, which include the lowrank correlation matrix completion in various fields such as the financial market and the lowrank density matrix completion from the quantum state tomography. For this class of problem ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we address lowrank matrix completion problems with fixed basis coefficients, which include the lowrank correlation matrix completion in various fields such as the financial market and the lowrank density matrix completion from the quantum state tomography. For this class
A Comparison between FixedBasis and VariableBasis Schemes for Function Approximation and Functional Optimization
"... Fixedbasis and variablebasis approximation schemes are compared for the problems of function approximation and functional optimization also known as infinite programming . Classes of problems are investigated for which variablebasis schemes with sigmoidal computational units perform better than ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Fixedbasis and variablebasis approximation schemes are compared for the problems of function approximation and functional optimization also known as infinite programming . Classes of problems are investigated for which variablebasis schemes with sigmoidal computational units perform better than
Results 1  10
of
3,978