Sciweavers

341 search results - page 33 / 69
» Quantum Computation and Lattice Problems
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
Peter Carr, Richard Hartley
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
Investigating the Performance of an Adiabatic Quantum Optimization Processor
We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary ...
Geordie Rose, Kamran Karimi, Neil G. Dickson, Fira...
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 1 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
COMPGEOM
2004
ACM
14 years 1 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
ECCC
2002
86views more  ECCC 2002»
13 years 7 months ago
Classical Physics and the Church-Turing Thesis
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
Andrew Chi-Chih Yao