7 search results - page 1 / 2 » Can General Relativistic Computers Break the Turing Barrier |
CIE
2006
Springer
13 years 8 months ago
2006
Springer
CIE
2007
Springer
13 years 11 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...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
ICCAD
2008
IEEE
14 years 1 months ago
2008
IEEE
— With process variation becoming a growing concern in deep submicron technologies, the ability to efficiently obtain an accurate estimate of failure probability of SRAM compone...
CVPR
2003
IEEE
14 years 6 months ago
2003
IEEE
In this paper we explore object recognition in clutter. We test our object recognition techniques on Gimpy and EZGimpy, examples of visual CAPTCHAs. A CAPTCHA ("Completely Au...