Results 1  10
of
9,182
High confidence visual recognition of persons by a test of statistical independence
 IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
of the human population reveals variation corresponding to several hundred independent degreesoffreedom. Morphogenetic randomness in the texture expressed phenotypically in the iris trabecular meshwork ensures that a test of statistical independence on two coded patterns originating from different eyes
On the (im)possibility of obfuscating programs
 Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract

Cited by 348 (24 self)
 Add to MetaCart
and complexitytheoretic applications, ranging from software protection to homomorphic encryption to complexitytheoretic analogues of Rice’s theorem. Most of these applications are based on an interpretation of the “unintelligibility ” condition in obfuscation as meaning that O(P) is a “virtual black box
Developments in the Measurement of Subjective WellBeing
 Psychological Science.
, 1993
"... F or good reasons, economists have had a longstanding preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract

Cited by 284 (7 self)
 Add to MetaCart
such as very pleasant and very unpleasant and by a neutral value. In a similar fashion, public opinion during a political debate is sometimes assessed by means of a "dial group," in which a group of observers continually indicate their pleasure or displeasure with the candidates' views
A proof of Alon’s second eigenvalue conjecture
, 2003
"... A dregular graph has largest or first (adjacency matrix) eigenvalue λ1 = d. Consider for an even d ≥ 4, a random dregular graph model formed from d/2 uniform, independent permutations on {1,...,n}. We shall show that for any ɛ>0 we have all eigenvalues aside from λ1 = d are bounded by 2 √ d − 1 ..."
Abstract

Cited by 166 (1 self)
 Add to MetaCart
. These theorems resolve the conjecture of Alon, that says that for any ɛ>0andd, the second largest eigenvalue of “most ” random dregular graphs are at most 2 √ d − 1+ɛ (Alon did not specify precisely what “most ” should mean or what model of random graph one should take). 1
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
using a random sample of 282 persistent students and the 282 dropout students. Once again, the results were almost identical to those obtained with the whole sample. Note. Scores ranged from 1 to 7 and are based on four items for each of the seven motivational subscales. Means differ significantly at p
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
tested for recipient identities. Random oracles offer no protection against this. To circumvent this obstable, we need to make the rerandomization elements nonpublic, and tie them to each individual private key. In practical terms, this means that private keys must convey extra components (although
The analysis of adaptation in a plantbreeding programme
 Australian Journal of Agricultural Research
, 1963
"... The adaptation of barley varieties was studied by the use of grain yields of a randomly chosen group of 277 varieties from a world collection, grown in replicated trials for several seasons at three sites in South Australia. For each variety a linear regression of yield on the mean yield of all vari ..."
Abstract

Cited by 146 (0 self)
 Add to MetaCart
The adaptation of barley varieties was studied by the use of grain yields of a randomly chosen group of 277 varieties from a world collection, grown in replicated trials for several seasons at three sites in South Australia. For each variety a linear regression of yield on the mean yield of all
A new probability inequality using typical moments and concentration results
 Proceedings of the 50th Annual Symposium on Foundations of Computer Science
, 2009
"... It is of wide interest to prove upper bounds on the probability that the sum of random variables X1, X2,...Xn deviates much from its mean. If the Xi are independent realvalued mean 0 random variables, then we know from the Central Limit Theorem (CLT) that their sum (in the limit) has Gaussian ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
It is of wide interest to prove upper bounds on the probability that the sum of random variables X1, X2,...Xn deviates much from its mean. If the Xi are independent realvalued mean 0 random variables, then we know from the Central Limit Theorem (CLT) that their sum (in the limit) has Gaussian
Pinning of polymers and interfaces by random potentials
, 2005
"... We consider a polymer, with monomer locations modeled by the trajectory of a Markov chain, in the presence of a potential that interacts with the polymer when it visits a particular site 0. Disorder is introduced by, for example, having the interaction vary from one monomer to another, as a constant ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
constant u plus i.i.d. mean0 randomness. There is a critical value of u above which the polymer is pinned, placing a positive fraction of its monomers at 0 with high probability. This critical point may differ for the quenched, annealed and deterministic cases. We show that selfaveraging occurs, meaning
On complete convergence in mean of normed sums of independent random elements in Banach spaces
 Stoch. Anal. Appl
"... Abstract: For a sequence of random elements T n n ≥ 1 in a real separable Banach space , we study the notion of T n converging completely to 0 in mean of order p where p is a positive constant. This notion is stronger than (i) T n converging completely to 0 and (ii) T n converging to 0 in mean of o ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract: For a sequence of random elements T n n ≥ 1 in a real separable Banach space , we study the notion of T n converging completely to 0 in mean of order p where p is a positive constant. This notion is stronger than (i) T n converging completely to 0 and (ii) T n converging to 0 in mean
Results 1  10
of
9,182