152 search results - page 10 / 31 » Robust Polynomials and Quantum Algorithms |
CIE
2007
Springer
14 years 2 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
JGO
2008
13 years 8 months ago
2008
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a background subtraction algorithm aimed at efciency and robustness to common sources of disturbance such as illumination changes, camera gain and exposure variations, ...
FOCS
2000
IEEE
14 years 25 days ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
This work presents a new approach to contour representation and coding. It consists of an improved fitting of high-degree (4th to 18th ) implicit polynomials (IPs) to the contour,...