Sciweavers

1434 search results - page 165 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
NETCOOP
2009
Springer
15 years 6 months ago
Probabilistic Analysis of Hierarchical Cluster Protocols for Wireless Sensor Networks
Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information ...
Ingemar Kaj
GCC
2005
Springer
15 years 5 months ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
FC
2003
Springer
101views Cryptology» more  FC 2003»
15 years 5 months ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt
LSSC
2001
Springer
15 years 4 months ago
A Quasi-Monte Carlo Method for Integration with Improved Convergence
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
Aneta Karaivanova, Ivan Dimov, Sofiya Ivanovska
FOCS
1994
IEEE
15 years 4 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim