Sciweavers

235 search results - page 40 / 47
» Quantum certificate complexity
Sort
View
COLT
2007
Springer
13 years 11 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
DAC
2004
ACM
14 years 8 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
COMPUTING
2006
119views more  COMPUTING 2006»
13 years 7 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
NIPS
2000
13 years 9 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson