Results 1  10
of
759,049
NONSMOOTH PROBLEMS OF MECHANICS OF MACHINES FOR CONSTRUCTION
"... Abstract: This paper presents a mathematical formulation of nonsmooth problem of mechanics. Some nonsmooth characteristics of chosen elements are presented on the diagrams. These elements serve the purpose of representing unilateral limiters of displacements and velocities, dry friction and pseudo ..."
Abstract
 Add to MetaCart
Abstract: This paper presents a mathematical formulation of nonsmooth problem of mechanics. Some nonsmooth characteristics of chosen elements are presented on the diagrams. These elements serve the purpose of representing unilateral limiters of displacements and velocities, dry friction
A firstorder primaldual algorithm for convex problems with applications to imaging
, 2010
"... In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering in this paper ..."
Abstract

Cited by 435 (20 self)
 Add to MetaCart
In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering
On constitutive relations in nonsmooth elasto/viscoplasticity
"... Abstract. A general treatment of constitutive relations in elastoplasticity and elasto/viscoplasticity is presented. The treatment holds for general nonsmooth problems and it applies to nonsmooth yield criteria and to functions characterized by nondifferentiability. The formulation is developed ..."
Abstract
 Add to MetaCart
Abstract. A general treatment of constitutive relations in elastoplasticity and elasto/viscoplasticity is presented. The treatment holds for general nonsmooth problems and it applies to nonsmooth yield criteria and to functions characterized by nondifferentiability. The formulation is developed
On robust multigrid methods for nonsmooth variational problems
 Multigrid Methods V
, 1996
"... We consider the fast solution of large, piecewise smooth minimization problems as resulting from the approximation of elliptic free boundary problems. The most delicate question in constructing a multigrid method for a nonlinear, nonsmooth problem is how to represent the nonlinearity on the coars ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We consider the fast solution of large, piecewise smooth minimization problems as resulting from the approximation of elliptic free boundary problems. The most delicate question in constructing a multigrid method for a nonlinear, nonsmooth problem is how to represent the nonlinearity
Nonlinear component analysis as a kernel eigenvalue problem

, 1996
"... We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all ..."
Abstract

Cited by 1554 (85 self)
 Add to MetaCart
We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all possible 5pixel products in 16x16 images. We give the derivation of the method, along with a discussion of other techniques which can be made nonlinear with the kernel approach; and present first experimental results on nonlinear feature extraction for pattern recognition.
Solving multiclass learning problems via errorcorrecting output codes
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1995
"... Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass l ..."
Abstract

Cited by 730 (8 self)
 Add to MetaCart
Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1772 (10 self)
 Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis
Semantic Similarity in a Taxonomy: An InformationBased Measure and its Application to Problems of Ambiguity in Natural Language
, 1999
"... This article presents a measure of semantic similarityinanisa taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edgecounting approach. The a ..."
Abstract

Cited by 601 (9 self)
 Add to MetaCart
. The article presents algorithms that take advantage of taxonomic similarity in resolving syntactic and semantic ambiguity, along with experimental results demonstrating their e#ectiveness. 1. Introduction Evaluating semantic relatedness using network representations is a problem with a long history
KernelBased Object Tracking
, 2003
"... A new approach toward target representation and localization, the central component in visual tracking of nonrigid objects, is proposed. The feature histogram based target representations are regularized by spatial masking with an isotropic kernel. The masking induces spatiallysmooth similarity fu ..."
Abstract

Cited by 889 (4 self)
 Add to MetaCart
A new approach toward target representation and localization, the central component in visual tracking of nonrigid objects, is proposed. The feature histogram based target representations are regularized by spatial masking with an isotropic kernel. The masking induces spatiallysmooth similarity
Results 1  10
of
759,049