440 search results - page 27 / 88 » On partial randomness |
122
click to vote
TMC
2012
13 years 2 months ago
2012
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
MST
2000
14 years 11 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
AHS
2006
IEEE
15 years 5 months ago
2006
IEEE
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
ESORICS
2003
Springer
15 years 5 months ago
2003
Springer
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper we analyze several protocols for Gaussian half-duplex multiple relay networks where each node either transmits or receives on a particular resource. We present ac...