Results 1  10
of
1,409,889
Natural weak factorization systems
 Archivum Mathematicum
"... Dedicated to Jiˇrí Rosick´y at the occasion of his sixtieth birthday Abstract. In order to facilitate a natural choice for morphisms created by the (left or right) lifting property as used in the definition of weak factorization systems, the notion of natural weak factorization system in the categor ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
Dedicated to Jiˇrí Rosick´y at the occasion of his sixtieth birthday Abstract. In order to facilitate a natural choice for morphisms created by the (left or right) lifting property as used in the definition of weak factorization systems, the notion of natural weak factorization system
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
Weak factorizations, fractions and homotopies
 MR2141595 (2006c:18001), Zbl 1077.18002
"... Abstract. We show that the homotopy category can be assigned to any category equipped with a weak factorization system. A classical example of this construction is the stable category of modules. We discuss a connection with the open map approach to bisimulations proposed by Joyal, Nielsen and Win ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
Abstract. We show that the homotopy category can be assigned to any category equipped with a weak factorization system. A classical example of this construction is the stable category of modules. We discuss a connection with the open map approach to bisimulations proposed by Joyal, Nielsen
Simple Constructive Weak Factorization
, 2006
"... We give a simplified algorithm of the functorial weak factorization of birational morphisms of nonsingular varieties over a field of characteristic zero into a composite of blowups and blowdowns with smooth centers. ..."
Abstract
 Add to MetaCart
We give a simplified algorithm of the functorial weak factorization of birational morphisms of nonsingular varieties over a field of characteristic zero into a composite of blowups and blowdowns with smooth centers.
Weak Factorization Systems and Topological Functors
 Appl. Categ. Struct
, 2000
"... Weak factorization systems, important in homotopy theory, are related to injective objects in comma{categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cobrantly generated. We also prese ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Weak factorization systems, important in homotopy theory, are related to injective objects in comma{categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cobrantly generated. We also
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
Determining the Number of Factors in Approximate Factor Models
, 2000
"... In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors c ..."
Abstract

Cited by 538 (29 self)
 Add to MetaCart
In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors
Algorithms for Nonnegative Matrix Factorization
 In NIPS
, 2001
"... Nonnegative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minim ..."
Abstract

Cited by 1230 (5 self)
 Add to MetaCart
Nonnegative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown
Evaluating the use of exploratory factor analysis in psychological research
 Psychological Methods
, 1999
"... Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each of ..."
Abstract

Cited by 495 (4 self)
 Add to MetaCart
Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each
Results 1  10
of
1,409,889