350 search results - page 27 / 70 » Lower and upper bounds on obtaining history independence |
103
click to vote
CRYPTO
2012
Springer
13 years 2 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
102
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—In this paper, a novel error probability analysis of orthogonal space-time block coding (OSTBC) over independent but not necessarily identical Hoyt (Nakagami-q) fading channels ...
AAAI
1994
15 years 1 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
104
click to vote
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
— In this paper, we derive a precise expression of spatial degrees of freedom (DOF) for two mutually interfering broadcast channels (IFBC) as a function of arbitrary numbers of t...