4973 search results - page 798 / 995 » Probabilistic Algorithms in Robotics |
189
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
192
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
173
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
183
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
184
click to vote
QEST
2008
IEEE
16 years 26 days ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...