Results 1  10
of
493,761
Weak notions of Jacobian determinant and relaxation
"... In this paper we study two weak notions of Jacobian determinant for Sobolev maps, namely the distributional Jacobian and the relaxed total variation, which in general could be different. We show some cases of equality and use them to give an explicit expression for the relaxation of some polyconvex ..."
Abstract
 Add to MetaCart
In this paper we study two weak notions of Jacobian determinant for Sobolev maps, namely the distributional Jacobian and the relaxed total variation, which in general could be different. We show some cases of equality and use them to give an explicit expression for the relaxation of some polyconvex
A Weak Notion of Equivalence in Bayesian Statistical Theory∗
"... Throughout this section, (Ω,A,P) will be a statistical experiment, i.e., P is a family of probability measures on the measurable space (Ω,A). The paper [2] introduces a weak notion of equivalence of σfields to establish a right statement of part (i) of Theorem 4 of [1]. In a statistical ..."
Abstract
 Add to MetaCart
Throughout this section, (Ω,A,P) will be a statistical experiment, i.e., P is a family of probability measures on the measurable space (Ω,A). The paper [2] introduces a weak notion of equivalence of σfields to establish a right statement of part (i) of Theorem 4 of [1]. In a statistical
Weak Notions of Normality and Vanishing up to Rank
"... We study vanishing results for L2cohomology of countable groups under the presence of subgroups that satisfy some weak normality condition. As a consequence, we show that the L2Betti numbers of SLn(R) for any infinite integral domain R vanish below degree n − 1. Another application is the vanishin ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study vanishing results for L2cohomology of countable groups under the presence of subgroups that satisfy some weak normality condition. As a consequence, we show that the L2Betti numbers of SLn(R) for any infinite integral domain R vanish below degree n − 1. Another application
A Behavioral Notion of Subtyping
 ACM Transactions on Programming Languages and Systems
, 1994
"... The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of ..."
Abstract

Cited by 514 (18 self)
 Add to MetaCart
is easy for programmers to use. The subtype relation is based on the specifications of the sub and supertypes; the paper presents a way of specifying types that makes it convenient to define the subtype relation. The paper also discusses the ramifications of this notion of subtyping on the design of type
The strength of weak learnability
 Machine Learning
, 1990
"... Abstract. This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distributionfree (PAC) learning model. A concept class is learnable (or strongly learnable) if, given access to a Source of examples of the unknown concept, the learner with h ..."
Abstract

Cited by 861 (24 self)
 Add to MetaCart
notions of learnability are equivalent. A method is described for converting a weak learning algorithm into one that achieves arbitrarily high accuracy. This construction may have practical applications as a tool for efficiently converting a mediocre learning algorithm into one that performs extremely
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (15 self)
 Add to MetaCart
presented by Schapire in his paper "The strength of weak learnability", and represents an improvement over his results. The analysis of our algorithm provides general upper bounds on the resources required for learning in Valiant's polynomial PAC learning framework, which are the best general
A WEAK NOTION OF STRICT PSEUDOCONVEXITY. APPLICATIONS AND EXAMPLES.
, 906
"... Abstract. Let Ω be a bounded C ∞smoothly bounded domain in C n. For such a domain we define a new notion between strict pseudoconvexity and pseudoconvexity: the size of the set W of weakly pseudoconvex points on ∂Ω is small with respect to Minkowski dimension: near each point in the boundary ∂Ω, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Let Ω be a bounded C ∞smoothly bounded domain in C n. For such a domain we define a new notion between strict pseudoconvexity and pseudoconvexity: the size of the set W of weakly pseudoconvex points on ∂Ω is small with respect to Minkowski dimension: near each point in the boundary ∂Ω
On The Equivalence Of Various Weak Notions Of Solutions Of Elliptic Pdes With Measurable Ingredients
 Progress in Elliptic and Parabolic Partial Differential Equations
, 1996
"... this paper it is assumed that F satisfies the structure conditions (0.3) and (0.4), which we abbreviate to "F has structure": ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper it is assumed that F satisfies the structure conditions (0.3) and (0.4), which we abbreviate to "F has structure":
Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System
 In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles
, 1995
"... Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting apph ..."
Abstract

Cited by 506 (14 self)
 Add to MetaCart
Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting
Results 1  10
of
493,761