Results 1  10
of
1,152,035
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
with high probability is able to output an hypothesis that is correct on all but an arbitrarily small fraction of the instances. The concept class is weakly learnable if the learner can produce an hypothesis that performs only slightly better than random guessing. In this paper, it is shown that these two
ON THE ZEROS AND COEFFICIENTS OF CERTAIN WEAKLY HOLOMORPHIC MODULAR FORMS
"... For this paper we assume familiarity with the basics of the theory of modular forms as may be found, for instance, in Serre’s classic introduction [12]. A weakly holomorphic modular form of weight k ∈ 2 Z for Γ = PSL2(Z) is a holomorphic function f on the upper halfplane that satisfies ..."
Abstract

Cited by 30 (10 self)
 Add to MetaCart
For this paper we assume familiarity with the basics of the theory of modular forms as may be found, for instance, in Serre’s classic introduction [12]. A weakly holomorphic modular form of weight k ∈ 2 Z for Γ = PSL2(Z) is a holomorphic function f on the upper halfplane that satisfies
Isomorphism of certain weak L p spaces
 Studia Math
"... It is shown that the weak L p spaces ℓ p, ∞,L p, ∞ [0,1], and L p, ∞ [0, ∞) are isomorphic as Banach spaces. 1 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
It is shown that the weak L p spaces ℓ p, ∞,L p, ∞ [0,1], and L p, ∞ [0, ∞) are isomorphic as Banach spaces. 1
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
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
Explicit formulas for the Szegö kernel on certain weakly pseudoconvex domains
 Proc. AMS 123
, 1995
"... Abstract. The objective of this paper is to determine the Szegö kernel of the domain 3 = {(z, f, w) e C+m+1; Qmw> z2 + K2"} explicitly in closed form. The purpose of this paper is to determine the Szegö kernel explicitly for a new class of weakly pseudoconvex domains. This class of do ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
discovery of Christ and Geller [CG] that the Szegö kernel of certain weakly pseudoconvex domains is not analytic off the diagonal was derived from Nagel's [N] explicit formula. In [M2], an explicit formula allowed Machedon to test if the Szegö kernel is a singular integral with respect to a certain
Strengths and Weaknesses of quantum computing
 SIAM JOURNAL OF COMPUTATION
, 1997
"... Recently a great deal of attention has been focused on quantum computation following a ..."
Abstract

Cited by 386 (10 self)
 Add to MetaCart
Recently a great deal of attention has been focused on quantum computation following a
Gapped Blast and PsiBlast: a new generation of protein database search programs
 NUCLEIC ACIDS RESEARCH
, 1997
"... The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while ..."
Abstract

Cited by 8393 (85 self)
 Add to MetaCart
enhancing their sensitivity to weak similarities. A new criterion for triggering the extension of word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST program that runs at approximately three times the speed of the original. In addition, a method is introduced
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 522 (16 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised
Results 1  10
of
1,152,035