373 search results - page 3 / 75 » Abstract Geometrical Computation for Black Hole Computation |
HPDC
1999
IEEE
13 years 9 months ago
1999
IEEE
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Geometrical Computation and the Linear Blum, Shub and Smale Model Geometrical Computation and the Linear Blum, Shub and Smale Model J´erˆome Durand-Lose Laboratoire d’Informati...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
TMC
2010
13 years 3 months ago
2010
—Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes fo...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13, 14] showed how, in principle, one can explicit...