نتایج جستجو برای: random key representation

تعداد نتایج: 1030562  

2002
Eleni Drinea Mihaela Enachescu Michael Mitzenmacher

Journal: :bulletin of the iranian mathematical society 2011
s. mahmoodi a. r. soltani

2009
Peter D. Hoff Xiaoyue Niu

Classical regression analysis relates the expectation of a response variable to a linear combination of explanatory variables. In this article, we propose a covariance regression model that parameterizes the covariance matrix of a multivariate response vector as a parsimonious quadratic function of explanatory variables. The approach can be seen as analogous to the mean regression model, and ha...

Journal: :Fuzzy Sets and Systems 2016
Jasper De Bock Arthur Van Camp Márcio Alves Diniz Gert de Cooman

We provide representation theorems for both finite and countable sequences of finite-valued random variables that are considered to be partially exchangeable. In their most general form, our results are presented in terms of sets of desirable gambles, a very general framework for modelling uncertainty. Its key advantages are that it allows for imprecision, is more expressive than almost every o...

Journal: :Applicable Algebra in Engineering, Communication and Computing 2006

J‎. ‎ Bourgain P. Sarnak, Z. Rudnick

‎We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares‎. ‎We examine several statistics of these point sets‎, ‎such as the electrostatic potential‎, ‎Ripley's function‎, ‎the variance of the number of points in random spherical caps‎, ‎and the covering radius‎. ‎Some of the results are conditional on t...

Journal: :Archive of Formal Proofs 2017
Andreas Lochbihler S. Reza Sefidgar Bhargav Bhatt

In this AFP entry, we show how to specify game-based cryptographic security notions and formally prove secure several cryptographic constructions from the literature using the CryptHOL framework. Among others, we formalise the notions of a random oracle, a pseudo-random function, an unpredictable function, and of encryption schemes that are indistinguishable under chosen plaintext and/or cipher...

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید