440 search results - page 45 / 88 » On partial randomness |
RSA
2010
14 years 10 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper is concerned with control applications over lossy data networks. Sensor data is transmitted to an estimation-control unit over a network, and control command...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...