Results 1  10
of
1,607,189
TEST FOR POSITIVE AND NEGATIVE DEFINITENESS
"... We want a computationally simple test for a symmetric matrix to induce a positive definite quadratic form. We first treat the case of 2 × 2 matrices where the result is simple. Then, we present the conditions for n × n symmetric matrices to be positive definite. Finally, we state the corresponding c ..."
Abstract
 Add to MetaCart
condition for the symmetric matrix to be negative definite or neither. Before starting all these cases, we recall the relationship between the eigenvalues and the determinant and trace of a matrix. For a matrix A, the determinant and trace are the product and sum of the eigenvalues: det(A) = λ1 · · · λn
CONDITIONALLY STRICTLY NEGATIVE DEFINITE KERNELS
"... Abstract. In this note we refine the notion of conditionally negative definite kernels to the notion of conditionally strictly negative definite kernels and study its properties. We show that the class of these kernels carries some surprising rigidity, in particular, the word metric function on Coxe ..."
Abstract
 Add to MetaCart
Abstract. In this note we refine the notion of conditionally negative definite kernels to the notion of conditionally strictly negative definite kernels and study its properties. We show that the class of these kernels carries some surprising rigidity, in particular, the word metric function
INSTABILITY OF AN EQUILIBRIUM WITH NEGATIVE DEFINITE LINEARIZATION
, 2007
"... Abstract. A nonlinear parabolic differential equation is presented which has at least one equilibrium. This equilibrium is shown to have a negative definite linearization, but a spectrum which includes zero. An elementary construction shows that the equilibrium is not stable. 1. ..."
Abstract
 Add to MetaCart
Abstract. A nonlinear parabolic differential equation is presented which has at least one equilibrium. This equilibrium is shown to have a negative definite linearization, but a spectrum which includes zero. An elementary construction shows that the equilibrium is not stable. 1.
Algorithms for Nonnegative Matrix Factorization
 In NIPS
, 2001
"... Nonnegative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minim ..."
Abstract

Cited by 1230 (5 self)
 Add to MetaCart
Nonnegative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown
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
Intrinsic and extrinsic motivations: Classic definitions and new directions
 Contemporary Educational Psychology
, 2000
"... Intrinsic and extrinsic types of motivation have been widely studied, and the distinction between them has shed important light on both developmental and educational practices. In this review we revisit the classic definitions of intrinsic and extrinsic motivation in light of contemporary research a ..."
Abstract

Cited by 561 (8 self)
 Add to MetaCart
Intrinsic and extrinsic types of motivation have been widely studied, and the distinction between them has shed important light on both developmental and educational practices. In this review we revisit the classic definitions of intrinsic and extrinsic motivation in light of contemporary research
ON THE CLASSIFICATION OF DISCRETELY NEGATIVE DEFINITE, TRIVIAL HOMEOMORPHISMS
"... Abstract. Let S (N) = Ψ. We wish to extend the results of [21] to Eisenstein, bijective rings. We show that ˜m is characteristic, negative definite and infinite. Moreover, in this setting, the ability to characterize onetoone random variables is essential. It was Banach who first asked whether nul ..."
Abstract
 Add to MetaCart
Abstract. Let S (N) = Ψ. We wish to extend the results of [21] to Eisenstein, bijective rings. We show that ˜m is characteristic, negative definite and infinite. Moreover, in this setting, the ability to characterize onetoone random variables is essential. It was Banach who first asked whether
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Thumbs up? Sentiment Classification using Machine Learning Techniques
 IN PROCEEDINGS OF EMNLP
, 2002
"... We consider the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative. Using movie reviews as data, we find that standard machine learning techniques definitively outperform humanproduced baselines. However, the three mac ..."
Abstract

Cited by 1028 (7 self)
 Add to MetaCart
We consider the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative. Using movie reviews as data, we find that standard machine learning techniques definitively outperform humanproduced baselines. However, the three
Results 1  10
of
1,607,189