Results 1  10
of
197
BAYESIAN PERSPECTIVEPLANE (BPP) FOR LOCALIZATION
"... Abstract: The "perspectiveplane " problem proposed in this paper is similar to the "perspectivenpoint (PnP) " or "perspectivenline (PnL) " problems, yet with broader applications and potentials, since planar scenes are more widely available than control points or l ..."
Abstract
 Add to MetaCart
or lines in practice. We address this problem in the Bayesian framework and propose the "Bayesian perspectiveplane (BPP) " algorithm, which can deal with more generalized constraints rather than typespecific ones to determine the plane for localization. Computation of the plane normal
Weak Random Sources, Hitting Sets, and BPP Simulations
, 1998
"... We show how to simulate any BPP algorithm in polynomial time using a weak random source of r bits and minentropy r fl for any fl ? 0. This follows from a more general result about sampling with weak random sources. Our result matches an informationtheoretic lower bound and solves a question that ..."
Abstract

Cited by 41 (6 self)
 Add to MetaCart
We show how to simulate any BPP algorithm in polynomial time using a weak random source of r bits and minentropy r fl for any fl ? 0. This follows from a more general result about sampling with weak random sources. Our result matches an informationtheoretic lower bound and solves a question
Simulating BPP Using a General Weak Random Source
 ALGORITHMICA
, 1996
"... We show how to simulate BPP and approximation algorithms in polynomial time using the output from a ffisource. A ffisource is a weak random source that is asked only once for R bits, and must output an Rbit string according to some distribution that places probability no more than 2 \GammaffiR on ..."
Abstract

Cited by 124 (17 self)
 Add to MetaCart
We show how to simulate BPP and approximation algorithms in polynomial time using the output from a ffisource. A ffisource is a weak random source that is asked only once for R bits, and must output an Rbit string according to some distribution that places probability no more than 2 \Gammaffi
Hardness vs. randomness
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1994
"... We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (eg P, NC, PSPACE,...) using an arbitrary function tha ..."
Abstract

Cited by 298 (27 self)
 Add to MetaCart
We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (eg P, NC, PSPACE,...) using an arbitrary function
Derandomizing BPP: The state of the art
 In Proc. of the 14th IEEE Int. Conf. on Computational Complexity
, 1999
"... The introduction of randomization into ecient computation has been one of the most fertile and useful ideas in computer science. In cryptography and asynchronous computing, randomization makes possible tasks that are impossible to perform deterministically. Even for function computation, many examp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the power of BPP, the class of problems solvable by probabilistic polynomial time algorithms making small constant error. What is the relative power of such algorithms compared to deterministic ones? This is largely open. On the one hand, it is possible that P = BPP, i.e., randomness is useless for solving
Comparing expressibility of normed BPA and normed BPP processes
 Acta Informatica
, 1999
"... Summary. We present an exact characterization of those transition systems which can be equivalently (up to bisimilarity) defined by the syntax of normed BPAτ and normed BPPτ processes. We give such a characterization for the subclasses of normed BPA and normed BPP processes as well. Next we demonstr ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
) the process ∆ ′ is effectively constructible. Analogous algorithms are provided for normed BPPτ processes. Simplified versions of the mentioned algorithms which work for normed BPA and normed BPP are given too. As a simple consequence we obtain the decidability of bisimilarity in the union of normed BPAτ
Recent Advances Towards Proving P=BPP
, 1998
"... Two independent techniques have been developed recently that yield sufficient conditions for P = BPP in terms of worstcase circuit complexity of functions computable in exponential time. Andreev, Clementi and Rolim proved that P = BPP provided that a sparse "efficiently enumerable" langu ..."
Abstract
 Add to MetaCart
and their relation with previously known sufficient conditions for P = BPP. 1 Introduction Randomness is very useful in the design of efficient algorithms for several important problems. Probabilistic algorithms are often the simpler ones to solve a given problem, or the most efficient, or the only efficiently
Comparing Expressibility of Normed BPA and Normed BPP Processes.
"... We compare the classes of behaviours (transition systems) which can be generated by normed BPAτ and normed BPPτ processes. We exactly classify the intersection of these two classes, i.e. the class of transition systems which can be equivalently (up to bisimilarity) described by the syntax of normed ..."
Abstract
 Add to MetaCart
respectively) process ∆ ′ such that ∆ is bisimilar to ∆′. Moreover, if the answer is positive then our algorithms also construct the process ∆′. Simplified versions of the algorithms mentioned above for normed BPA and normed BPP are given too. As an immediate (but important) consequence we also obtain
Notes on Complexity of Bisimilarity between BPA and BPP
, 2007
"... We consider the problem of deciding bisimilarity between a BPA process and a BPP process. This problem is known to be decidable, but no complexity bound has been provided so far. Our aim is to clarify the precise complexity and some related questions. In this short submission we present some prelimi ..."
Abstract
 Add to MetaCart
preliminary results in this direction. In particular we present a necessary and sufficient condition for a BPP process to be bisimilar with some BPA process, which can be checked in polynomial space. In the positive case, (a modification of) the algorithm can transform the given BPP process into a special
On basing ZK ̸= BPP on the hardness of pac learning
 In In Proc. CCC ’09
, 2009
"... Learning is a central task in computer science, and there are various formalisms for capturing the notion. One important model studied in computational learning theory is the PAC model of Valiant (CACM 1984). On the other hand, in cryptography the notion of “learning nothing” is often modelled by th ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
with zeroknowledge arguments, then no efficient algorithm can PAC learn polynomialsize circuits. They also prove a weak reverse implication, that if a certain nonstandard learning task is hard, then zero knowledge is nontrivial. This motivates the question we explore here: can one prove that hardness
Results 1  10
of
197