11321 search results - page 51 / 2265 » Improvements to Turing's method |
169
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
141
click to vote
COCO
1990
Springer
15 years 10 months ago
1990
Springer
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
175
click to vote
TOCL
2008
15 years 5 months ago
2008
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
129
click to vote
MLQ
1998
15 years 5 months ago
1998
We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of “measure 0 set” as considered before by Martin-L¨of, Schnorr, and others. W...
156
click to vote
CVPR
2003
IEEE
16 years 8 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...