Results 11 - 20 of 4,307

Quantum complexity theory

by Ethan Bernstein, Umesh Vazirani - 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
the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a bounded-error probabilistic Turing machine, and thus not in the class

Stochastic Perturbation Theory

by G. W. Stewart , 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a first-order perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract - Cited by 907 (36 self) - Add to MetaCart
. In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a first-order perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating

A probabilistic theory of occupancy and emptiness

by Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulakos - In Proceedings of European Conference on Computer Vision (ECCV , 2002
"... Abstract. This paper studies the inference of 3D shape from a set of Ò noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, Lambertian scenes and arbitrary viewpoint configurations. Based on formal definitions of visibility, occupancy ..."
Abstract - Cited by 30 (3 self) - Add to MetaCart
Abstract. This paper studies the inference of 3D shape from a set of Ò noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, Lambertian scenes and arbitrary viewpoint configurations. Based on formal definitions of visibility

Graphical models, exponential families, and variational inference

by Martin J. Wainwright, Michael I. Jordan , 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract - Cited by 819 (28 self) - Add to MetaCart
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical

Probabilistic Theory of Transport Processes with Polarization

by Guillaume Bal , George Papanicolaou, Leonid Ryzhik - SIAM APPL. MATH , 2000
"... We derive a probabilistic representation for solutions of matrix-valued transport equations that account for polarization eects. Such equations arise in radiative transport for the Stokes parameters that model the propagation of light through turbulent atmospheres. They also arise in radiative tran ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
We derive a probabilistic representation for solutions of matrix-valued transport equations that account for polarization eects. Such equations arise in radiative transport for the Stokes parameters that model the propagation of light through turbulent atmospheres. They also arise in radiative

PROBABILISTIC THEORIES: WHAT IS SPECIAL ABOUT QUANTUM MECHANICS?

by Giacomo Mauro D’Ariano , 2009
"... Quantum Mechanics (QM) is a very special probabilistic theory, yet we don’t know which operational principles make it so. All axiomatization attempts suffer at least one postulate of a mathematical nature. Here I will analyze the possibility of deriving QM as the mathematical representation of a fa ..."
Abstract - Cited by 24 (5 self) - Add to MetaCart
Quantum Mechanics (QM) is a very special probabilistic theory, yet we don’t know which operational principles make it so. All axiomatization attempts suffer at least one postulate of a mathematical nature. Here I will analyze the possibility of deriving QM as the mathematical representation of a

A Probabilistic Theory for Intertemporal Indifference

by Mehraj Bin, Yasaar Parouty, Maarten Jacobus Postma , 2014
"... This paper provides a closed form distribution for the probability of intertemporal indifference between a certain quantity of a commodity now, ()Q q00 = , and some future quantity ()Q T q = at time t = T assuming a discount weight, ( ) ()w T 0,1 ∈. ..."
Abstract - Add to MetaCart
This paper provides a closed form distribution for the probability of intertemporal indifference between a certain quantity of a commodity now, ()Q q00 = , and some future quantity ()Q T q = at time t = T assuming a discount weight, ( ) ()w T 0,1 ∈.

Fusion, Propagation, and Structuring in Belief Networks

by Judea Pearl - ARTIFICIAL INTELLIGENCE , 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract - Cited by 484 (8 self) - Add to MetaCart
with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. tree

Combining symbolic and neural learning to revise probabilistic theories

by J. Jeffrey Mahoney, Raymond J. Mooney - IN PROCEEDINGS OF THE 1992 MACHINE LEARNING WORKSHOP ON INTEGRATED LEARNING IN REAL DOMAINS , 1992
"... This paper describes Rapture -- a system for revising probabilistic theories that combines symbolic and neural-network learning methods. Rapture uses a modified version of backpropagation to refine the certainty factors of a Mycin-style rule-base and it uses ID3's information gain heuristic to ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
This paper describes Rapture -- a system for revising probabilistic theories that combines symbolic and neural-network learning methods. Rapture uses a modified version of backpropagation to refine the certainty factors of a Mycin-style rule-base and it uses ID3's information gain heuristic

Property Testing and its connection to Learning and Approximation

by Oded Goldreich, Shafi Goldwasser, Dana Ron
"... We study the question of determining whether an unknown function has a particular property or is ffl-far from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract - Cited by 475 (67 self) - Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being k-colorable or having a ae-clique (clique of density ae
Results 11 - 20 of 4,307