Results 1  10
of
1,250,246
Weakly ominimal nonvaluational structures
"... A weakly ominimal structure M = (M, ≤, +,...) expanding an ordered group (M, ≤, +) is called nonvaluational iff for every cut 〈C, D 〉 of (M, ≤) definable in M, we have that inf{y − x: x ∈ C, y ∈ D} = 0. The study of nonvaluational weakly ominimal expansions of real closed fields carried out in ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A weakly ominimal structure M = (M, ≤, +,...) expanding an ordered group (M, ≤, +) is called nonvaluational iff for every cut 〈C, D 〉 of (M, ≤) definable in M, we have that inf{y − x: x ∈ C, y ∈ D} = 0. The study of nonvaluational weakly ominimal expansions of real closed fields carried out
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
well. In addition, the construction has some interesting theoretical consequences, including a set of general upper bounds on the complexity of any strong learning algorithm as a function of the allowed error e.
COMPLETION AND DIFFERENTIABILITY IN WEAKLY OMINIMAL STRUCTURES
"... Abstract. Let R = (R, <, +, ·,...) be a nonvaluational weakly ominimal real closed field, I a definable convex open subset of R and f: I → R a definable function. We prove that {x ∈ I: f ′ (x) exists in R} is definable and f ′ is definable if f is differentiable. 1. ..."
Abstract
 Add to MetaCart
Abstract. Let R = (R, <, +, ·,...) be a nonvaluational weakly ominimal real closed field, I a definable convex open subset of R and f: I → R a definable function. We prove that {x ∈ I: f ′ (x) exists in R} is definable and f ′ is definable if f is differentiable. 1.
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
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
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
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
What Do We Know about Capital Structure? Some Evidence from International Data
 Journal of Finance
, 1995
"... We investigate the determinants of capital structure choice by analyzing the financing decisions of public firms in the major industrialized countries. At an aggregate level, firm leverage is fairly similar across the G7 countries. We find that factors identified by previous studies as correlated i ..."
Abstract

Cited by 954 (14 self)
 Add to MetaCart
We investigate the determinants of capital structure choice by analyzing the financing decisions of public firms in the major industrialized countries. At an aggregate level, firm leverage is fairly similar across the G7 countries. We find that factors identified by previous studies as correlated
Results 1  10
of
1,250,246