Results 1  10
of
47,084
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 13236 (32 self)
 Add to MetaCart
theoretical and algorithmic aspects of the theory. The goal of this overview is to demonstrate how the abstract learning theory established conditions for generalization which are more general than those discussed in classical statistical paradigms and how the understanding of these conditions inspired new
A.: Postclassical probability theory
 in Quantum Theory: Informational Foundations and Foils, G. Chiribella and R.W. Spekkens, eds
"... ar ..."
THE POSSIBILITY OF RECONCILING QUANTUM MECHANICS WITH CLASSICAL PROBABILITY THEORY ∗
, 2007
"... We describe a scheme for constructing quantum mechanics in which a quantum system is considered as a collection of open classical subsystems. This allows using the formal classical logic and classical probability theory in quantum mechanics. Our approach nevertheless allows completely reproducing th ..."
Abstract
 Add to MetaCart
We describe a scheme for constructing quantum mechanics in which a quantum system is considered as a collection of open classical subsystems. This allows using the formal classical logic and classical probability theory in quantum mechanics. Our approach nevertheless allows completely reproducing
Bell’s Theorem And ”Classical ” Probability Theory
, 1998
"... Using CH model of Bell’s theorem and only by applying the conditional probability definition in ”classical ” probability theory,without imposing the locality condition,we are able to show that the stochastic realistic (CH) model cannot reproduce all of the predictions of quantum mechanics. PACS numb ..."
Abstract
 Add to MetaCart
Using CH model of Bell’s theorem and only by applying the conditional probability definition in ”classical ” probability theory,without imposing the locality condition,we are able to show that the stochastic realistic (CH) model cannot reproduce all of the predictions of quantum mechanics. PACS
Could a Classical Probability Theory Describe Quantum Systems?
"... Quantum Mechanics (QM) is a quantum probability theory based on the density matrix. The possibility of applying classical probability theory, which is based on the probability distribution function (PDF), to describe quantum systems is investigated in this work. In a sense this also addresses the q ..."
Abstract
 Add to MetaCart
Quantum Mechanics (QM) is a quantum probability theory based on the density matrix. The possibility of applying classical probability theory, which is based on the probability distribution function (PDF), to describe quantum systems is investigated in this work. In a sense this also addresses
Probability: Theory and examples
 CAMBRIDGE U PRESS
, 2011
"... Some times the lights are shining on me. Other times I can barely see. Lately it occurs to me what a long strange trip its been. Grateful Dead In 1989 when the first edition of the book was completed, my sons David and Greg were 3 and 1, and the cover picture showed the Dow Jones at 2650. The last t ..."
Abstract

Cited by 1331 (16 self)
 Add to MetaCart
twenty years have brought many changes but the song remains the same. The title of the book indicates that as we develop the theory, we will focus our attention on examples. Hoping that the book would be a useful reference for people who apply probability in their work, we have tried to emphasize
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
BPP. The class BQP of languages that are efficiently decidable (with small errorprobability) on a quantum Turing machine satisfies BPP ⊆ BQP ⊆ P ♯P. Therefore, there is no possibility of giving a mathematical proof that quantum Turing machines are more powerful than classical probabilistic Turing
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1044 (73 self)
 Add to MetaCart
programs and disjunctive databases more easily when classical negation is available. Computationally, classical negation can be eliminated from extended programs by a simple preprocessor. Extended programs are identical to a special case of default theories in the sense of Reiter. 1
Intrinsic and extrinsic motivations: Classic definitions and new directions.
 Contemporary Educational Psychology,
, 2000
"... Intrinsic and extrinsic types of motivation have been widely studied, and the distinction between them has shed important light on both developmental and educational practices. In this review we revisit the classic definitions of intrinsic and extrinsic motivation in light of contemporary research ..."
Abstract

Cited by 635 (8 self)
 Add to MetaCart
Intrinsic and extrinsic types of motivation have been widely studied, and the distinction between them has shed important light on both developmental and educational practices. In this review we revisit the classic definitions of intrinsic and extrinsic motivation in light of contemporary research
Large N field theories, string theory and gravity
, 2001
"... We review the holographic correspondence between field theories and string/M theory, focusing on the relation between compactifications of string/M theory on Antide Sitter spaces and conformal field theories. We review the background for this correspondence and discuss its motivations and the evide ..."
Abstract

Cited by 1443 (45 self)
 Add to MetaCart
and the evidence for its correctness. We describe the main results that have been derived from the correspondence in the regime that the field theory is approximated by classical or semiclassical gravity. We focus on the case of the N = 4 supersymmetric gauge theory in four dimensions, but we discuss also field
Results 1  10
of
47,084