Results 1  10
of
1,007
Testing problems with sublearning sample complexity
 In Proceedings of the Eleventh Annual ACM Conference on Computational Learning Theory
, 1998
"... We study the problem of determining, for a class of functions ¡ , whether an unknown target function ¢ is contained in ¡ or is “far ” from any function in ¡. Thus, in contrast to problems of learning, where we must construct a good approximation to ¢ in ¡ on the basis of sample data, in problems of ..."
Abstract

Cited by 22 (12 self)
 Add to MetaCart
We study the problem of determining, for a class of functions ¡ , whether an unknown target function ¢ is contained in ¡ or is “far ” from any function in ¡. Thus, in contrast to problems of learning, where we must construct a good approximation to ¢ in ¡ on the basis of sample data, in problems
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive
Sampling from large matrices: an approach through geometric functional analysis
 Journal of the ACM
, 2006
"... Abstract. We study random submatrices of a large matrix A. We show how to approximately compute A from its random submatrix of the smallest possible size O(r log r) with a small error in the spectral norm, where r = �A�2 F /�A�22 is the numerical rank of A. The numerical rank is always bounded by, a ..."
Abstract

Cited by 132 (5 self)
 Add to MetaCart
slight improvement on the best known sample complexity for an approximation algorithm for MAX2CSP problems. We use methods of Probability in Banach spaces, in particular the law of large numbers for operatorvalued random variables. 1.
Quantitative mass spectrometric multiple reaction monitoring assays for major plasma proteins.
 Mol. Cell. Proteomics
, 2006
"... Quantitative LCMS/MS assays were designed for tryptic peptides representing 53 high and medium abundance proteins in human plasma using a multiplexed multiple reaction monitoring (MRM) approach. Of these, 47 produced acceptable quantitative data, demonstrating withinrun coefficients of variation ..."
Abstract

Cited by 144 (2 self)
 Add to MetaCart
(CVs) (n ؍ 10) of 222% (78% of assays had CV <10%). A number of peptides gave CVs in the range 27% in five experiments (10 replicate runs each) continuously measuring 137 MRMs, demonstrating the precision achievable in complex digests. Depletion of six high abundance proteins
The Rate Loss in the WynerZiv Problem
 IEEE Trans. Inform. Theory
, 1996
"... The ratedistortion function for source coding with side information at the decoder (the "WynerZiv problem") is given in terms of an auxiliary random variable, which forms a Markov chain with the source and the side information. This Markov chain structure, typical to the solution of mult ..."
Abstract

Cited by 95 (16 self)
 Add to MetaCart
is the minimax capacity of a suitable additive noise channel. Furthermore, in the worst case this loss is equal to the maximin redundancy over the rate distortion function of the additive noise "test" channel. For example, the loss in the WynerZiv problem is less than 0:5 bit per sample in the squared
The Power of Sampling in Knowledge Discovery
, 1993
"... We consider the problem of approximately verifying the truth of sentences of tuple relational calculus in a given relation M by considering only a random sample of M . We define two different measures for the error of a universal sentence in a relation. For a set of n universal sentences each with a ..."
Abstract

Cited by 62 (2 self)
 Add to MetaCart
We consider the problem of approximately verifying the truth of sentences of tuple relational calculus in a given relation M by considering only a random sample of M . We define two different measures for the error of a universal sentence in a relation. For a set of n universal sentences each
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
as a consequence of new information technologies. The empirical record is conclusive on this matter (Carnoy 2000). Yet, there is a serious unemployment problem in Europe, unrelated to technology, and there are dramatic problems of underemployment in the developing world, caused by economic
Dumb money: Mutual fund flows and the cross section of stock returns,
 Journal of Financial Economics,
, 2008
"... We thank Nicholas Barberis and Judith Chevalier for helpful comments. We thank Breno Schmidt for research assistance. ABSTRACT We use mutual fund flows as a measure for individual investor sentiment for different stocks, and find that high sentiment predicts low future returns. Fund flows are dumb ..."
Abstract

Cited by 103 (4 self)
 Add to MetaCart
economic themes or investment styles in reallocating funds. Collectively, one can measure individual sentiment by looking at which funds receive inflows and which receive outflows, and can relate this sentiment to different stocks by examining the holdings of mutual funds. This paper tests whether
An Ant Colony System Hybridized With A New Local Search For The Sequential Ordering Problem
, 2000
"... We present a new local optimizer called SOP3exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly without increasing computational complexity. An algorithm that combines the SOP3exchange with an Ant Col ..."
Abstract

Cited by 62 (14 self)
 Add to MetaCart
Colony Optimization algorithm is described and we present experimental evidence that the resulting algorithm is more effective than existing methods for the problem. The bestknown results for many of a standard test set of 22 problems are improved using the SOP3exchange with our Ant Colony
Finite Sample Limited Information Inference Methods for Structural Equations and Models with Generated Regressors
 International Economic Review
, 1999
"... FOR JOURNAL OF ECONOMIC LITERATURE We propose exact tests and condence sets for various structural models typically estimated by IV methods, such as models with unobserved regressors, which remain valid despite the presence of identication problems or weak instruments. Two approaches are considered ..."
Abstract

Cited by 64 (27 self)
 Add to MetaCart
FOR JOURNAL OF ECONOMIC LITERATURE We propose exact tests and condence sets for various structural models typically estimated by IV methods, such as models with unobserved regressors, which remain valid despite the presence of identication problems or weak instruments. Two approaches
Results 1  10
of
1,007