Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
15,310
The strength of weak learnability
- MACHINE LEARNING
, 1990
"... This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distribution-free (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 high prob ..."
Abstract
-
Cited by 871 (26 self)
- Add to MetaCart
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 notions
Quantum complexity theory
- in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97
Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis
- Econometric Society Monograph Series
, 1990
"... Reading this text on the application of game theory to two-sided matching problems, I relived an experience shared by many readers of this journal-the process known as &dquo;resident match.&dquo; At a prescribed moment, over 90 % of sen-ior medical students frantically tear open an envelope ..."
Abstract
-
Cited by 705 (25 self)
- Add to MetaCart
that holds the name of the hospital at which they will train. Some go into the resident match kicking and screaming. Others are so trusting of the process (or so weak of conviction) that they let it decide whether they will be internists or surgeons. Fighting off the vivid image of the great mechanical maw
Strengths and weaknesses of quantum computing
, 1996
"... Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both solv ..."
Abstract
-
Cited by 381 (10 self)
- Add to MetaCart
Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both
The University of Florida sparse matrix collection
- NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract
-
Cited by 536 (17 self)
- Add to MetaCart
and graphs, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, and power networks). The collection meets a vital need that artificially-generated matrices cannot meet, and is widely used by the sparse matrix algorithms community
Framing: toward clarification of a fractured paradigm’’,
- Journal of Communication
, 1993
"... In response to the proposition that communication lacks disciplinary status because of deficient core knowledge, I propose that we turn an ostensible weakness into a strength. We should identify our mission as bringing together insights and theories that would otherwise remain scattered in other di ..."
Abstract
-
Cited by 620 (1 self)
- Add to MetaCart
In response to the proposition that communication lacks disciplinary status because of deficient core knowledge, I propose that we turn an ostensible weakness into a strength. We should identify our mission as bringing together insights and theories that would otherwise remain scattered in other
Illusion and well-being: A social psychological perspective on mental health.
- Psychological Bulletin,
, 1988
"... Many prominent theorists have argued that accurate perceptions of the self, the world, and the future are essential for mental health. Yet considerable research evidence suggests that overly positive selfevaluations, exaggerated perceptions of control or mastery, and unrealistic optimism are charac ..."
Abstract
-
Cited by 988 (20 self)
- Add to MetaCart
nature with all of its discrepancies from the ideal image without feeling real concern. It would convey the wrong impression to say that they are self-satisfied. What we must rather say is that they can take the frailties and sins, weaknesses and evils of human nature in the same unquestioning spirit
Image retrieval: ideas, influences, and trends of the new age
- ACM COMPUTING SURVEYS
, 2008
"... We have witnessed great interest and a wealth of promise in content-based image retrieval as an emerging technology. While the last decade laid foundation to such promise, it also paved the way for a large number of new techniques and systems, got many new people involved, and triggered stronger ass ..."
Abstract
-
Cited by 485 (13 self)
- Add to MetaCart
association of weakly related fields. In this article, we survey almost 300 key theoretical and empirical contributions in the current decade related to image retrieval and automatic image annotation, and in the process discuss the spawning of related subfields. We also discuss significant challenges involved
On the (im)possibility of obfuscating programs
- Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract
-
Cited by 348 (24 self)
- Add to MetaCart
, ” in the sense that anything one can efficiently compute given O(P), one could also efficiently compute given oracle access to P. In this work, we initiate a theoretical investigation of obfuscation. Our main result is that, even under very weak formalizations of the above intuition, obfuscation is impossible
A Critique of Software Defect Prediction Models
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1999
"... Many organizations want to predict the number of defects (faults) in software systems, before they are deployed, to gauge the likely delivered quality and maintenance effort. To help in this numerous software metrics and statistical models have been developed, with a correspondingly large literatur ..."
Abstract
-
Cited by 292 (21 self)
- Add to MetaCart
of the models have often made heroic contributions to a subject otherwise bereft of empirical studies. However, there are a number of serious theoretical and practical problems in many studies. The models are weak because of their inability to cope with the, as yet, unknown relationship between defects
Results 1 - 10
of
15,310
