Results 1  10
of
1,165
STRICT CONVEXITY OF SOME SUBSETS OF HANKEL OPERATORS
"... Abstract. We find some extreme points in the unit ball of the set of Hankel operators and show that the unit ball of the set of compact Hankel operators is strictly convex. We use this result to show that the collection of N × N lower triangular Toeplitz contractions is strictly convex. We also find ..."
Abstract
 Add to MetaCart
Abstract. We find some extreme points in the unit ball of the set of Hankel operators and show that the unit ball of the set of compact Hankel operators is strictly convex. We use this result to show that the collection of N × N lower triangular Toeplitz contractions is strictly convex. We also
Strictness logic and polymorphic invariance
 In Proc. Logical Found. Comp. Sci
, 1992
"... We describe a logic for reasoning about higherorder strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets of domains. The axiomatisation of the lattice of strictness properties is shown to be sound and complete, and we then giv ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We describe a logic for reasoning about higherorder strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets of domains. The axiomatisation of the lattice of strictness properties is shown to be sound and complete, and we
Mining Closed Strict Episodes
"... Abstract—Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often occur in the vicinity of each other. Episodes also enforce in which order events are allowed to occur. In this ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
superepisodes. Moreover, to define a closedness concept for episodes we need a subset relationship between episodes, which is not trivial to define. We approach these problems by introducing strict episodes. We argue that this class is general enough, and at the same time we are able to define a natural subset
Strict quantization of coadjoint orbits
 J. Math. Phys
, 1998
"... A strict quantization of a compact symplectic manifold S on a subset I ⊆ R, containing 0 as an accumulation point, is defined as a continuous field of C ∗algebras {A�}�∈I, with A0 = C0(S), and a set of continuous crosssections {Q(f)}f∈C ∞ (S) for which Q0(f) = f. Here Q�(f ∗ ) = Q�(f) ∗ for all ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
A strict quantization of a compact symplectic manifold S on a subset I ⊆ R, containing 0 as an accumulation point, is defined as a continuous field of C ∗algebras {A�}�∈I, with A0 = C0(S), and a set of continuous crosssections {Q(f)}f∈C ∞ (S) for which Q0(f) = f. Here Q�(f ∗ ) = Q
Noisetolerant learning, the parity problem, and the statistical query model
 J. ACM
"... We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise. This results in a polynomialtime algorithm for the case of parity functions that depend on only the first O(log n log log n) bits of input. This is the first known ins ..."
Abstract

Cited by 165 (2 self)
 Add to MetaCart
instance of an efficient noisetolerant algorithm for a concept class that is provably not learnable in the Statistical Query model of Kearns [7]. Thus, we demonstrate that the set of problems learnable in the statistical query model is a strict subset of those problems learnable in the presence of noise
STRICTLY IRREDUCIBLE MAPS AND STRONG
"... Any space X in which no nonvoid open subset is meager is called a Baire space. In this paper, we will consider only T Baire spaces. Given a space X, we will use O(X) 2 to denote the set of all open subsets of X. If F(X) is any family of subsets of X, F+(X) will denote F(X) \ {~}. Thus the expression ..."
Abstract
 Add to MetaCart
Any space X in which no nonvoid open subset is meager is called a Baire space. In this paper, we will consider only T Baire spaces. Given a space X, we will use O(X) 2 to denote the set of all open subsets of X. If F(X) is any family of subsets of X, F+(X) will denote F(X) \ {~}. Thus
STRICTLY CONVEX CORNERS SCATTER
"... Abstract. We prove the absence of nonscattering energies for potentials in the plane having a corner of angle smaller than pi. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential ..."
Abstract
 Add to MetaCart
potential with a circular conic corner whose opening angle is outside a countable subset of (0, pi). 1.
Strict Approximation of Matrices
"... . This paper describes a mechanism which includes the wellknown strict approximation of a real vector which can be applied in the case of spectral approximation to define a unique strict spectral approximant of a matrix. For this purpose a new ordering is introduced. Key words. strict approximation ..."
Abstract
 Add to MetaCart
. This paper describes a mechanism which includes the wellknown strict approximation of a real vector which can be applied in the case of spectral approximation to define a unique strict spectral approximant of a matrix. For this purpose a new ordering is introduced. Key words. strict
ON STRICT SUNS IN ℓ ∞ (3)
, 2002
"... A subset M of a normed linear space X is said to be a strict sun if, for every point x ∈ X \M, the set of its nearest points from M is nonempty and if y ∈ M is a nearest point from M to x, then y is a nearest point from M to all points from the ray {λx + (1 − λ)y  λ> 0}. In the paper there obta ..."
Abstract
 Add to MetaCart
A subset M of a normed linear space X is said to be a strict sun if, for every point x ∈ X \M, the set of its nearest points from M is nonempty and if y ∈ M is a nearest point from M to x, then y is a nearest point from M to all points from the ray {λx + (1 − λ)y  λ> 0}. In the paper
Representing and querying correlated tuples in probabilistic databases
 In ICDE
, 2007
"... Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of probabilistic databases is hampered by two limitations: (1) current probabilistic databases make simplistic assumptions abo ..."
Abstract

Cited by 142 (11 self)
 Add to MetaCart
about the data (e.g., complete independence among tuples) that make it difficult to use them in applications that naturally produce correlated data, and (2) most probabilistic databases can only answer a restricted subset of the queries that can be expressed using traditional query languages. We
Results 1  10
of
1,165