Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,032
Asymptotic properties of regularized dierentialalgebraic equations
"... In the present paper we consider asymptotic properties of a regularization method for linear fully implicit dierentialalgebraic equations daes ..."
Abstract
- Add to MetaCart
In the present paper we consider asymptotic properties of a regularization method for linear fully implicit dierentialalgebraic equations daes
Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
- IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
, 2007
"... Many problems in signal processing and statistical inference involve finding sparse solutions to under-determined, or ill-conditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ℓ2) error term combined with a spa ..."
Abstract
-
Cited by 539 (17 self)
- Add to MetaCart
Many problems in signal processing and statistical inference involve finding sparse solutions to under-determined, or ill-conditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ℓ2) error term combined with a
Benchmarking Least Squares Support Vector Machine Classifiers
- NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract
-
Cited by 476 (46 self)
- Add to MetaCart
of equations in the dual space. While the SVM classifier has a large margin interpretation, the LS-SVM formulation is related in this paper to a ridge regression approach for classification with binary targets and to Fisher's linear discriminant analysis in the feature space. Multiclass categorization
Sparse Reconstruction by Separable Approximation
, 2007
"... Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least absolute shrinkage and selection operator (LASSO), wavelet-based deconvolution and reconstruction, and compressed sensing ..."
Abstract
-
Cited by 373 (38 self)
- Add to MetaCart
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least absolute shrinkage and selection operator (LASSO), wavelet-based deconvolution and reconstruction, and compressed sensing
Numerical stability criteria for dierentialalgebraic systems
"... In this paper we transfer classical results concerning Lyapunov stability of stationary solu tions x to the classes of DAEs being most interesting for circuit simulation thereby keeping smoothness as low as possible We formulate all criteria in terms of the original equation Those simple matrix cr ..."
Abstract
- Add to MetaCart
In this paper we transfer classical results concerning Lyapunov stability of stationary solu tions x to the classes of DAEs being most interesting for circuit simulation thereby keeping smoothness as low as possible We formulate all criteria in terms of the original equation Those simple matrix
Robust Anisotropic Diffusion
, 1998
"... Relations between anisotropic diffusion and robust statistics are described in this paper. Specifically, we show that anisotropic diffusion can be seen as a robust estimation procedure that estimates a piecewise smooth image from a noisy input image. The "edge-stopping" function in the ani ..."
Abstract
-
Cited by 361 (17 self)
- Add to MetaCart
in the anisotropic diffusion equation is closely related to the error norm and influence function in the robust estimation framework. This connection leads to a new "edge-stopping" function based on Tukey's biweight robust estimator, that preserves sharper boundaries than previous formulations
A completeness theorem for Kleene algebras and the algebra of regular events
- Information and Computation
, 1994
"... We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1 ..."
Abstract
-
Cited by 251 (27 self)
- Add to MetaCart
We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1
Models of Random Regular Graphs
- IN SURVEYS IN COMBINATORICS
, 1999
"... In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular g ..."
Abstract
-
Cited by 215 (33 self)
- Add to MetaCart
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular
Results 1 - 10
of
9,032
