Results 1  10
of
6,726
Various Notions of Compactness
, 2012
"... We document various notions of compactness, with some of their useful properties. Our main reference is [Engelking, 1989]. For counterexamples, refer to [Steen and Seebach Jr., 1995] while for background, see the excellent textbooks [Willard, 2004] or [Munkres, 2000]. Some of the proofs are taken fr ..."
Abstract
 Add to MetaCart
We document various notions of compactness, with some of their useful properties. Our main reference is [Engelking, 1989]. For counterexamples, refer to [Steen and Seebach Jr., 1995] while for background, see the excellent textbooks [Willard, 2004] or [Munkres, 2000]. Some of the proofs are taken
VARIOUS NOTIONS OF ASSOCIATED PRIME IDEALS
, 1994
"... In the theory of modules over commutative rings there are several possibilities of defining associated prime ideals. The usual definition of an associated prime ideal p for a module M is that p is the annihilator of an element of M. In [2] §1 exercise 17 a generalization of this notion is given. p i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In the theory of modules over commutative rings there are several possibilities of defining associated prime ideals. The usual definition of an associated prime ideal p for a module M is that p is the annihilator of an element of M. In [2] §1 exercise 17 a generalization of this notion is given. p
Comparison between various notions of conserved charges in asymptotically AdSspacetimes
, 2005
"... We derive hamiltionian generators of asymptotic symmetries for general relativity with asymptotic AdS boundary conditions using the “covariant phase space ” method of Wald et al. We then compare our results with other definitions that have been proposed in the literature. We find that our definition ..."
Abstract

Cited by 67 (8 self)
 Add to MetaCart
We derive hamiltionian generators of asymptotic symmetries for general relativity with asymptotic AdS boundary conditions using the “covariant phase space ” method of Wald et al. We then compare our results with other definitions that have been proposed in the literature. We find that our definition agrees with that proposed by Ashtekar et al, with the spinor definition, and with the background dependent definition of Henneaux and Teitelboim. Our definition disagrees with the one obtained from the “counterterm subtraction method, ” but the
Facial structures for various notions of positivity and applications to the theory of entanglement
, 2012
"... ..."
On the Relationships Between Induced ℓ ∞Gain and Various Notions of Dissipativity
"... Abstract — Several approaches to the dissipativity characterization of ℓ ∞gain performance measures are compared and contrasted. Points of comparison include whether the given characterization is both necessary and sufficient or merely sufficient for ℓ ∞gain, whether there is a simple relationship ..."
Abstract
 Add to MetaCart
Abstract — Several approaches to the dissipativity characterization of ℓ ∞gain performance measures are compared and contrasted. Points of comparison include whether the given characterization is both necessary and sufficient or merely sufficient for ℓ ∞gain, whether there is a simple relationship between the gain parameter (or gain function) and the supply rate or performance output, and whether the characterization employs auxiliary nonlinear filters. There is also a discussion of the roles of different types of bias in classical ℓ pgain performance criteria. I.
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 790 (10 self)
 Add to MetaCart
in 1979. Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them. An important distinction is that between a static and a dynamic slice. The former notion is computed without making assumptions regarding a program's input
On the algorithmic implementation of multiclass kernelbased vector machines
 Journal of Machine Learning Research
"... In this paper we describe the algorithmic implementation of multiclass kernelbased vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic ob ..."
Abstract

Cited by 559 (13 self)
 Add to MetaCart
In this paper we describe the algorithmic implementation of multiclass kernelbased vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic
SIGNAL RECOVERY BY PROXIMAL FORWARDBACKWARD SPLITTING
 MULTISCALE MODEL. SIMUL. TO APPEAR
"... We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unifi ..."
Abstract

Cited by 509 (24 self)
 Add to MetaCart
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a
Results 1  10
of
6,726