Results 1  10
of
2,559,428
Graded SelfReducibility
, 1998
"... We introduce two special kinds of selfreducible sets that we call timegraded and spacegraded languages. Attaching time and space bounds to them yields a uniform, quantitative definition of resourcebounded selfreducibility that applies to all languages. We apply this to study the relationship be ..."
Abstract
 Add to MetaCart
We introduce two special kinds of selfreducible sets that we call timegraded and spacegraded languages. Attaching time and space bounds to them yields a uniform, quantitative definition of resourcebounded selfreducibility that applies to all languages. We apply this to study the relationship
Amplifying lower bounds by means of selfreducibility
 IN IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY
, 2008
"... We observe that many important computational problems in NC¹ share a simple selfreducibility property. We then show that, for any problem A having this selfreducibility property, A has polynomial size TC 0 circuits if and only if it has TC⁰ circuits of size n 1+ɛ for every ɛ>0 (counting the num ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
the number of wires in a circuit as the size of the circuit). As an example of what this observation yields, consider the Boolean Formula Evaluation problem (BFE), which is complete for NC¹ and has the selfreducibility property. It follows from a lower bound of Impagliazzo, Paturi, and Saks, that BFE
Multiparty Communication Complexity
, 1989
"... A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain the Boo ..."
Abstract

Cited by 757 (22 self)
 Add to MetaCart
the Boolean answer deterministically with only a polynomial increase in communication with respect to the information lower bound given by the nondeterministic communication complexity of the function.
On SelfReducible Sets of Low Information Content
, 1994
"... Selfreducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this selfreducibility structure of a set can be used to access easil ..."
Abstract
 Add to MetaCart
Selfreducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this selfreducibility structure of a set can be used to access
Elastically deformable models
 Computer Graphics
, 1987
"... The goal of visual modeling research is to develop mathematical models and associated algorithms for the analysis and synthesis of visual information. Image analysis and synthesis characterize the domains of computer vision and computer graphics, respectively. For nearly three decades, the vision an ..."
Abstract

Cited by 881 (19 self)
 Add to MetaCart
The goal of visual modeling research is to develop mathematical models and associated algorithms for the analysis and synthesis of visual information. Image analysis and synthesis characterize the domains of computer vision and computer graphics, respectively. For nearly three decades, the vision
Limited information estimators and exogeneity tests for simultaneous probit models
, 1988
"... A twostep maximum likelihood procedure is proposed for estimating simultaneous probit models and is compared to alternative limited information estimators. Conditions under which each estimator attains the CramerRao lower bound are obtained. Simple tests for exogeneity based on the new twostep es ..."
Abstract

Cited by 465 (0 self)
 Add to MetaCart
A twostep maximum likelihood procedure is proposed for estimating simultaneous probit models and is compared to alternative limited information estimators. Conditions under which each estimator attains the CramerRao lower bound are obtained. Simple tests for exogeneity based on the new two
Secret Key Agreement by Public Discussion From Common Information
 IEEE Transactions on Information Theory
, 1993
"... . The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PX ..."
Abstract

Cited by 434 (18 self)
 Add to MetaCart
PXY Z , can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of PXY Z are presented. Lower bounds on the rate H(S)=N (as N !1
Selective sampling using the Query by Committee algorithm
 Machine Learning
, 1997
"... We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the twomember committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the numbe ..."
Abstract

Cited by 430 (7 self)
 Add to MetaCart
We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the twomember committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially
Combining SelfReducibility and Partial Information Algorithms
"... Abstract. A partial information algorithm for a language A computes, for some fixed m, for input words x1,..., xm a set of bitstrings containing χA(x1,..., xm). E.g., pselective, approximable, and easily countable languages are defined by the existence of polynomialtime partial information algorit ..."
Abstract
 Add to MetaCart
algorithms of specific type. Selfreducible languages, for different types of selfreductions, form subclasses of PSPACE. For a selfreducible language A, the existence of a partial information algorithm sometimes helps to place A into some subclass of PSPACE. The most prominent known result in this respect
Results 1  10
of
2,559,428